Submission #8000278
Source Code Expand
import collections import itertools import functools import math s = set([]) if __name__ == "__main__": n = math.factorial(int(input())) prims = (n + 1) * [0] p = 2 while n >= p*p: if n % p == 0: prims[p] += 1 n = n // p else: p += 1 prims[n] += 1 print(functools.reduce(lambda x, y: x * (y + 1), prims, 1) % 10**9 + 7)
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | nazar |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 413 Byte |
Status | RE |
Exec Time | 23 ms |
Memory | 3700 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 23 ms | 3700 KB |
sample_02.txt | WA | 22 ms | 3572 KB |
sample_03.txt | RE | 22 ms | 3572 KB |
subtask_1_certain_01.txt | WA | 21 ms | 3572 KB |
subtask_1_certain_02.txt | WA | 22 ms | 3572 KB |
subtask_1_certain_03.txt | RE | 22 ms | 3572 KB |
subtask_1_certain_04.txt | RE | 21 ms | 3572 KB |
subtask_1_rand_01.txt | RE | 21 ms | 3572 KB |
subtask_1_rand_02.txt | RE | 21 ms | 3572 KB |
subtask_1_rand_03.txt | RE | 22 ms | 3572 KB |