Submission #3011413
Source Code Expand
import math def factor(x): for i in range(2, x+1): count = 0 while x % i == 0: x = x / i count = count + 1 else: L[i - 1] = L[i - 1] + count N = int(input()) L = [0] * N for i in range(1, N): factor(i+1) M = 1 for i in range(N): M = M * (L[i]+1) print(M % (10 ** 9 +7))
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | ii_da_ba_shi |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 359 Byte |
Status | AC |
Exec Time | 159 ms |
Memory | 3060 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 | 18 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 159 ms | 3060 KB |
subtask_1_certain_01.txt | AC | 17 ms | 3060 KB |
subtask_1_certain_02.txt | AC | 17 ms | 3060 KB |
subtask_1_certain_03.txt | AC | 154 ms | 3060 KB |
subtask_1_certain_04.txt | AC | 154 ms | 3060 KB |
subtask_1_rand_01.txt | AC | 67 ms | 3060 KB |
subtask_1_rand_02.txt | AC | 64 ms | 3060 KB |
subtask_1_rand_03.txt | AC | 45 ms | 3060 KB |