Submission #1472932

---

Source Code Expand

#include <iostream>
using namespace std;

using ll = long long;

ll gcd(ll a, ll b) {
    if (b == 0) return a;
    else return gcd(b, a % b);
}

int main() {
    int N;
    cin >> N;

    ll x = 1,
       y = 1;
    for (int i = 0; i < N; i++) {
        ll c, d;
        cin >> c >> d;

        ll z = max((x + d - 1) / d, (y + c - 1) / c);
        x = d * z;
        y = c * z;
    }
    cout << x + y << endl;

    return 0;
}

Submission Info

Judge Result