Submission #2702982

---

Source Code Expand

#include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define fst first
#define snd second
using ll = long long;
using I = pair<int, int>;

int main() {
  int N;
  while (cin >> N) {
    ll x = 1, y = 1;
    for (int i = 0; i < N; i++) {
      ll A, B;
      cin >> A >> B;
      ll k = max((x + A - 1) / A, (y + B - 1) / B);
      x = A * k;
      y = B * k;
    }
    cout << (x + y) << endl;
  }
  return 0;
}

Submission Info

Judge Result