Submission #1832477

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define Rep(i, n) For(i, 0, (n))

const int inf = 999999999;
const int mod = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int main(){
	int n; cin >> n;
	int t = 0, a = 0, s;
	cin >> t >> a;
	For(i, 0, n - 1){
		int tt, aa; cin >> tt >> aa;
		if(tt >= t && aa >= a){
			t = tt; a = aa;
		}else{
			int j = max((t + tt - 1)/tt, (a + aa - 1)/aa);
			t = tt * j; a = aa * j;
		}
	}
	cout << t + a << endl;
	return 0;
}

Submission Info

Judge Result