Sherlock and Mind Palace Queries

3

2 votes
Easy
Problem

Magnussen - "No time for you to be a hero this time Mr. Holmes!"
Sherlock-"Oh, do your research. I am not a hero. I am a high-functioning sociopath."

Magnussen has been one of the worst rivals of Sherlock. He gives Sherlock T number of queries.
For each query, Sherlock is provided a number N.
He need to find
F(N) = Number of Divisors of N

PS- Largo I/O files. Use scanf/printf only

Constraints-

1<=T<=106
1<=N<=107

Input-
First line contains T- the number of queries
T lines follow. Each line has an integer N.

Output-
Print T lines, each line containing answer of corresponding F(N).

Sample Input
3
1
2
4
Sample Output
1
2
3
Time Limit: 2
Memory Limit: 256
Source Limit:
Explanation

1 has its divisor -1 . So F(1)= 1
2 has its divisors - 1,2 . So F(2) = 2
4 has its divisors- 1,2,4 .So F(4) = 3

Editor Image

?