Submission #1067329
Source Code Expand
# -*- coding: utf-8 -*- # problem C2 N = int(input()) ls = [1] ans = 0 if N == 1: print(1) else: for i in range(1, N+1): for j in ls: x = j * i if x not in ls: ans += 1 n.append(x) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | fuuuumin314 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 289 Byte |
Status | RE |
Exec Time | 23 ms |
Memory | 3064 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 | 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 | RE | 23 ms | 3064 KB |
sample_02.txt | RE | 23 ms | 3064 KB |
sample_03.txt | RE | 23 ms | 3064 KB |
subtask_1_certain_01.txt | AC | 23 ms | 3064 KB |
subtask_1_certain_02.txt | RE | 23 ms | 3064 KB |
subtask_1_certain_03.txt | RE | 23 ms | 3064 KB |
subtask_1_certain_04.txt | RE | 23 ms | 3064 KB |
subtask_1_rand_01.txt | RE | 22 ms | 3064 KB |
subtask_1_rand_02.txt | RE | 22 ms | 3064 KB |
subtask_1_rand_03.txt | RE | 23 ms | 3064 KB |