Submission #1497355
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main() { int64_t N; cin >> N; vector< pair<int64_t, int64_t> > v(N); for(int64_t i = 0; i < N; i++) { cin >> v[i].first >> v[i].second; } pair<int64_t, int64_t> current = v[0]; for(int64_t i = 1; i < N; i++) { int64_t mul = max((current.first + v[i].first - 1) / v[i].first, (current.second + v[i].second - 1) / v[i].second); mul = max((int64_t)1, mul); current.first = mul * v[i].first; current.second = mul * v[i].second; } cout << current.first + current.second << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoDeer and Election Report |
User | kkty |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 600 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 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 | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 1 ms | 256 KB |
1_004.txt | AC | 2 ms | 256 KB |
1_005.txt | AC | 1 ms | 256 KB |
1_006.txt | AC | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | AC | 1 ms | 256 KB |
1_009.txt | AC | 1 ms | 256 KB |
1_010.txt | AC | 1 ms | 256 KB |
1_011.txt | AC | 1 ms | 256 KB |
1_012.txt | AC | 1 ms | 256 KB |
1_013.txt | AC | 2 ms | 256 KB |
1_014.txt | AC | 2 ms | 256 KB |