Number of Divisors | HackerEarth

Given a number N, find the total number of divisors of N.

Input:
First-line contains a number of test cases T. Each test case contains a single integer N.

Output:
For each test case print number of divisors of N.

Constraints:

Test Files 1 to 5
1<=T<=20
1<=N<=1000000

Test Files 6 to 10
1<=T<=1000
1<=N<=1012

Sample Input
3
4
5
6
Sample Output
3
2
4



Comments

Popular posts from this blog

Boxes through a Tunnel | HackerRank

Array Manipulation | HackerRank

String Validators | HackerRank