Submission #1304130
Source Code Expand
n = input() t = [] a = [] c_t = 1 c_a = 1 for i in xrange(n): p,q = map(int, raw_input().split()) t.append(p) a.append(q) for i in xrange(n): if t[i] >= c_t and a[i] >= c_a: c_t = t[i] c_a = a[i] else: m = max(-(-c_t/t[i]), -(-c_a/a[i])) c_t = t[i]*m c_a = a[i]*m print c_t+c_a
Submission Info
Submission Time | |
---|---|
Task | C - AtCoDeer and Election Report |
User | tatamo |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 362 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 2692 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 | 10 ms | 2692 KB |
0_001.txt | AC | 10 ms | 2692 KB |
0_002.txt | AC | 10 ms | 2692 KB |
1_003.txt | AC | 10 ms | 2692 KB |
1_004.txt | AC | 13 ms | 2692 KB |
1_005.txt | AC | 11 ms | 2692 KB |
1_006.txt | AC | 11 ms | 2692 KB |
1_007.txt | AC | 11 ms | 2692 KB |
1_008.txt | AC | 11 ms | 2692 KB |
1_009.txt | AC | 10 ms | 2692 KB |
1_010.txt | AC | 10 ms | 2692 KB |
1_011.txt | AC | 10 ms | 2692 KB |
1_012.txt | AC | 11 ms | 2692 KB |
1_013.txt | AC | 13 ms | 2692 KB |
1_014.txt | AC | 13 ms | 2692 KB |