Submeter | Todas submissőes | Melhores | Voltar |
Problem hidden
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
Adicionado por: | ivar.raknahs |
Data: | 2015-01-17 |
Tempo limite: | 1s |
Tamanho do fonte: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Linguagem permitida: | Todas exceto: ASM64 CLOJURE ERL FSHARP JS-MONKEY PERL6 PY_NBC SCALA TCL |
Origem: | Own |