Submission #3769003
Source Code Expand
from fractions import gcd from functools import reduce N = int(input()) T = [int(input()) for i in range(N)] g = reduce(gcd,T) product = 1 for e in T: product *= e ans = product // pow(g,len(T) - 1) if ans > 10**18: ans = 10**18 print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Multiple Clocks |
User | pynomi |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 258 Byte |
Status | WA |
Exec Time | 37 ms |
Memory | 5048 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 |
All | sample_01.txt, sample_02.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 37 ms | 5048 KB |
sample_02.txt | AC | 36 ms | 5048 KB |
subtask_1_1.txt | WA | 37 ms | 5048 KB |
subtask_1_10.txt | AC | 37 ms | 5048 KB |
subtask_1_11.txt | AC | 36 ms | 5048 KB |
subtask_1_12.txt | WA | 37 ms | 5048 KB |
subtask_1_13.txt | WA | 37 ms | 5048 KB |
subtask_1_14.txt | WA | 36 ms | 5048 KB |
subtask_1_15.txt | AC | 36 ms | 5048 KB |
subtask_1_2.txt | WA | 36 ms | 5048 KB |
subtask_1_3.txt | WA | 36 ms | 5048 KB |
subtask_1_4.txt | WA | 37 ms | 5048 KB |
subtask_1_5.txt | WA | 36 ms | 5048 KB |
subtask_1_6.txt | WA | 37 ms | 5048 KB |
subtask_1_7.txt | AC | 37 ms | 5048 KB |
subtask_1_8.txt | AC | 37 ms | 5048 KB |
subtask_1_9.txt | WA | 37 ms | 5048 KB |