SPOJ.com - Problem DIVFACT

DIVFACT - Divisors of factorial

#simple-math #number-theory

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 10⁹+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

< Previous 1 2 3 4 5 Next >

	[Lakshman]: 2015-01-20 06:18:03 @epsilon value of mod is 1000000007 not 1000000009 check this and remove your code. --Francky--> I've removed it. Last edit: 2015-01-20 10:27:34
	Saurabh Mishra: 2015-01-23 18:33:56 check output for 0->1 it cost me 2 wa -_-
	Francky: 2015-01-18 04:12:10 Nice problem, but constraints are way too easy (I used a semi brute-force here). There's a place for a new edition, I'll set it soon. Please explain why you merge rank list ; it's rather uncommon, and hide python solutions when we have a C answer, for example. Edit : done. Have fun ;-) reply-> nice job. about python ,i'll take care of that next time. --Francky--> Many thanks. Last edit: 2015-01-18 11:18:42