Submission #2201854
Source Code Expand
def dict_count(dict, key): if key in dict: dict[key] = dict[key]+1 else: dict[key] = 1 return dict N = int(input()) divs = {} primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31] for n in range(2, N+1): for p in primes: while n%p==0: divs = dict_count(divs, p) n = n//p if p*p>n: break if n!=1: dict_count(divs, n) result = 1 base = 10**9+7 for c in divs.values(): result = (result*(c+1))%base print(result)
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | koshihikaru |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 454 Byte |
Status | AC |
Exec Time | 20 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 | 20 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 | 20 ms | 3064 KB |
subtask_1_certain_04.txt | AC | 20 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 18 ms | 3064 KB |
subtask_1_rand_02.txt | AC | 18 ms | 3064 KB |
subtask_1_rand_03.txt | AC | 18 ms | 3064 KB |