HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Unsorted > problem:


Divisors count

Section problems

• Permutations
• Reverse permutation
• Nameplates
• Adjacency matrix to edges list
• Edges list to Adjacency matrix
• Cities and roads
• Cycle detection
• Diameter of graph
• Divisors count
• GCD of ones
• Prime numbers
• Set cover problem
• Shopping
• Corridor
• D. Love-Hate
• Ferris Wheel
• Repetitions

Feedback

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

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

Problem description

Given a natural number N. Find number of all divisors of it.

Input

There is a single integer N on the first line (0 < N < 231 ).

Output

Write number of divisors.

Example

stdin stdout

6

4

Для отправки решений необходимо выполнить вход.

www.contester.ru