Submission #3769059

Source Code Expand

import fractions
N = int(input())
T = [int(input()) for i in range(N)]
pro = T[0]
for i in range(1,N):
    gcd = fractions.gcd(pro,T[i])
    lcm = (pro * T[i]) // gcd
    pro = lcm
print(lcm)

Submission Info

Submission Time
Task C - Multiple Clocks
User pynomi
Language Python (3.4.3)
Score 0
Code Size 199 Byte
Status RE
Exec Time 36 ms
Memory 5052 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 16
RE × 1
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 36 ms 5052 KB
sample_02.txt AC 35 ms 5052 KB
subtask_1_1.txt AC 35 ms 5052 KB
subtask_1_10.txt AC 35 ms 5052 KB
subtask_1_11.txt AC 35 ms 5052 KB
subtask_1_12.txt AC 35 ms 5052 KB
subtask_1_13.txt AC 35 ms 5052 KB
subtask_1_14.txt AC 35 ms 5052 KB
subtask_1_15.txt AC 35 ms 5052 KB
subtask_1_2.txt AC 35 ms 5052 KB
subtask_1_3.txt AC 35 ms 5052 KB
subtask_1_4.txt AC 35 ms 5052 KB
subtask_1_5.txt AC 35 ms 5052 KB
subtask_1_6.txt AC 35 ms 5052 KB
subtask_1_7.txt AC 36 ms 5052 KB
subtask_1_8.txt RE 35 ms 5052 KB
subtask_1_9.txt AC 35 ms 5052 KB