Submission #3453716


Source Code Expand

import math


def main():
    N = int(input())
    T = []
    A = []
    for i in range(N):
        t, a = map(int, input().split())
        T.append(t)
        A.append(a)

    for i in range(N):
        if math.gcd(A[i], T[i]) != 1:
            A[i] = A[i] // math.gcd(A[i], T[i])
            T[i] = T[i] // math.gcd(A[i], T[i])

    for i in range(N - 1):

        if T[i] / T[i + 1] > 1 or A[i] / A[i + 1] > 1:
            if T[i] / T[i + 1] >= A[i] / A[i + 1]:
                A[i + 1] = math.ceil(T[i] / T[i + 1]) * A[i + 1]
                T[i + 1] = math.ceil(T[i] / T[i + 1]) * T[i + 1]
            else:
                T[i + 1] = math.ceil(A[i] / A[i + 1]) * T[i + 1]
                A[i + 1] = math.ceil(A[i] / A[i + 1]) * A[i + 1]
    print(T[N - 1] + A[N - 1])


if __name__ == "__main__":
    main()

Submission Info

Submission Time
Task C - AtCoDeer and Election Report
User Xiii111
Language Python (3.4.3)
Score 0
Code Size 844 Byte
Status RE
Exec Time 20 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
RE × 3
RE × 15
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt
Case Name Status Exec Time Memory
0_000.txt RE 17 ms 3064 KB
0_001.txt RE 17 ms 3064 KB
0_002.txt RE 17 ms 3064 KB
1_003.txt RE 17 ms 3064 KB
1_004.txt RE 19 ms 3064 KB
1_005.txt RE 18 ms 3064 KB
1_006.txt RE 18 ms 3064 KB
1_007.txt RE 18 ms 3064 KB
1_008.txt RE 18 ms 3064 KB
1_009.txt RE 17 ms 3064 KB
1_010.txt RE 18 ms 3064 KB
1_011.txt RE 17 ms 3064 KB
1_012.txt RE 17 ms 3064 KB
1_013.txt RE 19 ms 3064 KB
1_014.txt RE 20 ms 3064 KB