Submission #929468

---

Source Code Expand

#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define Pi pair<int,int>
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 1, 0,-1,0 };
int dy[] = { 0, 1,0,-1 };

void solve() {
	int n;
	cin >> n;
	ull A, B;
	rep(i, n) {
		ull t, a;
		cin >> t >> a;
		if (i == 0) {
			A = t;
			B = a;
		}
		else {
			if (A > t || B > a) {
				double x, y;
				x = ceil((double)A / (double)t);
				y = ceil((double)B / (double)a);
				A = t * max(x, y);
				B = a * max(x, y);
			}
			else if(A <= t && B <= a){
				A = t;
				B = a;
			}
		}
	}
	P(A + B);
}

int main() {
	solve();
	return 0;
}

Submission Info

Judge Result