Submission #1230951
Source Code Expand
#include<iostream> #include<map> #include<set> #include<string> #include<algorithm> #include<cmath> using namespace std; typedef long long ll; typedef unsigned long long ull; const int inf = 999999999; const double pi = acos(-1); #define rep(i,m,n) for(int i = (m); i < (n); i++) #define mod(i) (i%(ll)(1e9 + 7)) int main(){ ll n,x,y; cin >> n ; cin >> x >> y; rep(i,1,n){ ll a,b; cin >> a >> b; if(a == b){ ll t = max(x,y); x = t; y = t; }else{ ll t = max((ll)((double)x/a + 0.9999),(ll)((double)y/b + 0.9999)); x = a * t; y = b * t; } } cout << x + y << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtCoDeer and Election Report |
User | hirata0517masato |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 655 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 1 ms | 256 KB |
1_005.txt | WA | 1 ms | 256 KB |
1_006.txt | WA | 1 ms | 256 KB |
1_007.txt | WA | 1 ms | 256 KB |
1_008.txt | WA | 1 ms | 256 KB |
1_009.txt | WA | 1 ms | 256 KB |
1_010.txt | WA | 1 ms | 256 KB |
1_011.txt | WA | 1 ms | 256 KB |
1_012.txt | WA | 1 ms | 256 KB |
1_013.txt | WA | 2 ms | 256 KB |
1_014.txt | AC | 2 ms | 256 KB |