Submission #2854364
Source Code Expand
from math import ceil from fractions import Fraction n = int(input()) nt, na = 1, 1 for i in range(n): rt, ra = list(map(int, input().split())) r = max([ceil(Fraction(nt, rt)), ceil(Fraction(na, ra))]) nt = r*rt na = r*ra # print(nt, na) print(nt+na)
Submission Info
Submission Time | |
---|---|
Task | C - AtCoDeer and Election Report |
User | tapyoka |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 286 Byte |
Status | AC |
Exec Time | 49 ms |
Memory | 5216 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 36 ms | 5216 KB |
0_001.txt | AC | 35 ms | 5048 KB |
0_002.txt | AC | 35 ms | 5048 KB |
1_003.txt | AC | 35 ms | 5048 KB |
1_004.txt | AC | 48 ms | 5088 KB |
1_005.txt | AC | 38 ms | 5048 KB |
1_006.txt | AC | 40 ms | 5048 KB |
1_007.txt | AC | 38 ms | 5048 KB |
1_008.txt | AC | 36 ms | 5048 KB |
1_009.txt | AC | 35 ms | 5048 KB |
1_010.txt | AC | 36 ms | 5048 KB |
1_011.txt | AC | 35 ms | 5048 KB |
1_012.txt | AC | 36 ms | 5048 KB |
1_013.txt | AC | 49 ms | 5088 KB |
1_014.txt | AC | 49 ms | 5088 KB |