Submission #8000993
Source Code Expand
N = int(input()) mod = 10**9 + 7 cnt = {} def yakusuu(p,dict): while True : if p == 1 : break for i in range(2,p+1): if p % i == 0: if i not in dict: dict[i] = 1 return yakusuu(p//i,dict) else: dict[i] += 1 return yakusuu(p//i,dict) for i in range(2,N+1): yakusuu(i,cnt) ans = 1 for i, j in cnt.items(): ans *= (j + 1) ans = ans % mod print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | minase_1224 |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 457 Byte |
Status | AC |
Exec Time | 29 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_certain_01.txt, subtask_1_certain_02.txt, subtask_1_certain_03.txt, subtask_1_certain_04.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 29 ms | 3064 KB |
subtask_1_certain_01.txt | AC | 17 ms | 3064 KB |
subtask_1_certain_02.txt | AC | 17 ms | 3064 KB |
subtask_1_certain_03.txt | AC | 29 ms | 3064 KB |
subtask_1_certain_04.txt | AC | 29 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 21 ms | 3064 KB |
subtask_1_rand_02.txt | AC | 22 ms | 3064 KB |
subtask_1_rand_03.txt | AC | 20 ms | 3064 KB |