HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Chapter 3. Repetition structures > problem:


02. How many divisors?

Volume problems

• Flowchart 1
• Flowchart 2
• Flowchart 3
• Sum until 0
• Sum less than N
• Sum of N numbers
• The power of 2
• 01. How many digits?
• 02. How many divisors?
• 04. Train
• 05. Factorial
• 06. X to the power of Y
• 07. Fibonacci Series
• 08. Binary to decimal
• 09. Decimal to binary
• 10. Maximum
• 11. Perfect numbers

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 1000/1000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.

Given an integer number N (10^4 >= N >= 1). Calculate how many divisors it has.

cin cout
5 2
6 4
9 3
Для отправки решений необходимо выполнить вход.

www.contester.ru