Submission #2854307


Source Code Expand

from math import ceil
n = int(input())
ta = [list(map(int, input().split())) for _ in range(n)]

nt, na = ta[0]
for i in range(1, n):
    
    r = max([ceil(nt/ta[i][0]), ceil(na/ta[i][1])])
    nt = r*ta[i][0]
    na = r*ta[i][1]
    # print(nt, na)

print(nt+na)

Submission Info

Submission Time
Task C - AtCoDeer and Election Report
User tapyoka
Language Python (3.4.3)
Score 0
Code Size 278 Byte
Status WA
Exec Time 21 ms
Memory 3188 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 11
WA × 4
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 AC 18 ms 3188 KB
0_001.txt AC 17 ms 3060 KB
0_002.txt AC 17 ms 3060 KB
1_003.txt AC 17 ms 3060 KB
1_004.txt AC 21 ms 3188 KB
1_005.txt WA 18 ms 3060 KB
1_006.txt AC 19 ms 3060 KB
1_007.txt AC 18 ms 3060 KB
1_008.txt AC 17 ms 3060 KB
1_009.txt WA 17 ms 3060 KB
1_010.txt AC 18 ms 3060 KB
1_011.txt AC 17 ms 3060 KB
1_012.txt WA 18 ms 3060 KB
1_013.txt WA 21 ms 3188 KB
1_014.txt AC 21 ms 3188 KB