Submission #1575841
Source Code Expand
n=int(input()) mod=10**9+7 ans=1 from math import factorial f=factorial(n) p=[2] for i in range(2,1001): flag=0 for j in p: if i%j==0: flag=1 break if flag==1: continue p.append(i) for i in p: k=0 while f%i**k==0: k+=1 ans=ans*k print(ans%mod)
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | lovemuffin |
Language | PyPy3 (2.4.0) |
Score | 300 |
Code Size | 339 Byte |
Status | AC |
Exec Time | 204 ms |
Memory | 39280 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 | 176 ms | 38640 KB |
sample_02.txt | AC | 166 ms | 38512 KB |
sample_03.txt | AC | 204 ms | 39280 KB |
subtask_1_certain_01.txt | AC | 165 ms | 38512 KB |
subtask_1_certain_02.txt | AC | 169 ms | 38512 KB |
subtask_1_certain_03.txt | AC | 199 ms | 39152 KB |
subtask_1_certain_04.txt | AC | 196 ms | 39152 KB |
subtask_1_rand_01.txt | AC | 186 ms | 39024 KB |
subtask_1_rand_02.txt | AC | 175 ms | 38896 KB |
subtask_1_rand_03.txt | AC | 169 ms | 38640 KB |