All submissions for this problem are available.
In number theory, factorization is the breaking down of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer. Your job is to calculate number of unique factorization(containing at least two positive integers greater than one) of a number. For example: 12 has 3 unique factorizations: 2*2*3, 2*6, 3*4 . Note: 3*4 and 4*3 are not considered different.
Input will begin with an integer T, the number of test cases. Then there are T lines, each containing exactly one number N. 1<=T<=50 and 2<=N<=1000,000,000
For every number N, output a single line containing number of unique factorization of N.
Input: 3 12 36 3150 Output: 3 8 91
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH 3.5, GO, NODEJS, WSPC, ICK, BF, PRLG, JS, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.