Given a number N, count total number of divisors of N!.
Error
|
|
---|---|
@Ibrahim Nash | 5761 |
@blackshadows | 5715 |
@akhayrutdinov | 5111 |
@mb1973 | 4989 |
@Quandray | 4944 |
@saiujwal13083 | 4506 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3516 |
@sushant_a | 3459 |
@verma_ji | 3341 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@aroranayan999 | 1115 |
@bt8816103042 | 739 |
@thealchemist627 | 456 |
@akashkale117 | 453 |
@shivanandp12345678910 | 453 |
@dalwainazism125 | 453 |
@codeantik | 448 |
@SherlockHolmes3 | 447 |
@SHOAIBVIJAPURE | 430 |
@shalinibhataniya1097 | 408 |
@ShamaKhan1 | 392 |
Complete Leaderboard |
Given a number N, count total number of divisors of N!.
Examples:
Input : N = 4
Output: 8
4! is 24. Divisors of 24 are 1, 2, 3, 4, 6,
8, 12 and 24.
Input : N = 5
Output : 16
5! is 120. Divisors of 120 are 1, 2, 3, 4,
5, 6, 8, 10, 12, 15, 20, 24 30, 40, 60 and
120
Input : N = 6
Output : 30
Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The next T lines will contain an integer N.
Output:
Corresponding to each test case, in a new line, print result in it.
Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 100
Example:
Input:
2
5
6
Output:
16
30
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes