Submission #1649596

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

int main(void) {
	int n;
	int t[1001], a[1001];
	long long int p, q;
	long long int w, e;

	cin >> n;
	FOR(i, 1, n) {
		cin >> t[i] >> a[i];
	}
	p = t[1];
	q = a[1];

	FOR(i, 2, n) {
		if (p%t[i] == 0) {
			w = p / t[i];
		}
		else {
			w = p / t[i] + 1;
		}
		if (q%a[i] == 0) {
			e = q / a[i];
		}
		else {
			e = q / a[i] + 1;
		}
		w = max(w, e);
		p = t[i] * w;
		q = a[i] * w;
	}

	cout << p + q << endl;
	return 0;
}

Submission Info

Judge Result