시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 512 MB | 918 | 787 | 738 | 87.131% |
Given an integer n, compute the number of divisors of n.
A divisor is an integer, d (1 <= d <= n) that evenly divides n.
Example: If n=10, divisors are: 1, 2, 5 and 10. So the result would be 4.
Example: If n=104717, divisors are 1 and 104717. This is a prime number so the number of divisors is 2.
The first line contains an integer C (1 <= C <= 10) with the amount of numbers you need to process. The next C lines will contain an integer n (1 <= n < 10000) each. You have to compute the number of divisors of these values.
For each integer n, print a line with the number n itself, a space and the number of divisors.
10 1 2 3 4 5 9999 31 10 20 1047
1 1 2 2 3 2 4 3 5 2 9999 12 31 2 10 4 20 6 1047 4