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.
Input
The first line contains T, number of testcases.
T lines follows each containing the number N.
Output
Print T lines of output each containing the answer.
Example
Input: 3 2 3 4 Output: 2 4 8
Constraints
1 <= T <= 500
0 <= N <= 50000
hide comments
Oasis:
2015-07-10 11:59:54
AC in 0.11s in one go..my 100th...:) |
|
DHEERAJ KUMAR:
2015-07-05 23:51:01
good problem :)
|
|
kp:
2015-06-30 12:57:57
another concept bagged :) |
|
:.Mohib.::
2015-06-28 15:11:09
I like it!! Awsm que!! ;) |
|
saifullah:
2015-06-18 14:23:39
AC in one go!! |
|
[Mayank Pratap]:
2015-06-17 18:12:25
My 199th problem was so nice... AC in 0.3s |
|
jas.py:
2015-06-14 15:51:57
sieves+power of prime(in factorial)->AC
|
|
mani_mckinnon:
2015-05-26 18:45:53
Made it after tough job....
|
|
vishwajit kumar vishnu:
2015-03-26 10:00:23
Getting wrong answer on test case 5. Can someone help :(
|
|
Sue:
2015-03-23 17:12:58
a good problem :))
|
Added by: | ivar.raknahs |
Date: | 2015-01-17 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 JS-MONKEY |
Resource: | Own |