Counting Divisors

CSESMathematicsOpen on judge ↗

Given n integers, your task is to report for each integer the number of its divisors. For example, if x=18, the correct answer is 6 because its divisors are 1,2,3,6,9,18. Input The first input line has an integer n: the number of integers. After this, there are n lines, each containing an integer x. Output For each integer, print the number of its divisors. Constraints - 1 \le n \le 10^5

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