DIVFACT - Divisors of factorial
Given a number, find the total number of divisors of the factorial of the number.
Since the answer can be very large, print answer modulo 109+7.
The first line contains T, number of testcases.
T lines follows each containing the number N.
Print T lines of output each containing the answer.
Input: 3 2 3 4 Output: 2 4 8
1 <= T <= 500
0 <= N <= 50000
Given constraints are incorrect, the code didn't give TLE when I replaced Upper limit from 50000 to 100005
hi guys.i am submitting the code for many testcases it is passing .but it is showing time limit exceeded and can anyone of them give some test cases
50th : )
good question! take care of 0! and inverse modulo
Used Legendre's Formulation
same here @pranjalikumar9 :((
don't know why my code is getting wrong on test case 6... anyone here have any idea about it????
nice question i already solved this type of problem like prime factorize of factorial.. it's quite easy when you fiqure out... :D
a typical sieve prob!!!
long caused me 5 WA's