Count Divisors

CodeChefOpen on judge ↗

Count all the factors of a given number $n$. ###Input: - First and the only line will contain a number $n$. ###Output: - The number of factors of the number $n$. ###Constraints - 1 <= n <= 10^14 ###Subtasks - 30 points : 1 <= n <= 10^7 - 70 points : original constraints ###Sample Input: 10 24 ###Sample Output: 4 8 ###EXPLANATION: In test case 1, 10 has factors: 1, 2, 5, 10. So, the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI