Submission #1818263

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cmath>

#define	MOD 1000000007;
#define PI 3.14159265358979323846;
using namespace std;
typedef long long ll;
ll mod = 1000000007;

int main()
{
	ll N;
	cin >> N;
	ll T[1000], A[1000], P[1000];

	ll t, a;
	for (ll i = 0; i < N; i++)
	{
		cin >> T[i] >> A[i];

		if (i == 0) {
			t = T[i];
			a = A[i];
		}
		else {
			ll b = (t - 1) / T[i] + 1;
			ll c = (a - 1) / A[i] + 1;

			ll k = max(b, c);

			t = k * T[i];
			a = k * A[i];
		}
	}

	cout << t + a << endl;

	return 0;
}
//
//ll N;
//cin >> N;
//ll T[1000], A[1000], P[1000];
//
//ll t, a;
//for (ll i = 0; i < N; i++)
//{
//	cin >> T[i] >> A[i];
//
//	if (i == 0) {
//		P[i] = T[i] + A[i];
//	}
//	else {
//		ll CurrentT = P[i - 1] * T[i - 1] / (T[i - 1] + A[i - 1]);
//		ll CurrentA = P[i - 1] * A[i - 1] / (T[i - 1] + A[i - 1]);
//
//		ll b = CurrentT / T[i] + (CurrentT % T[i] == 0 ? 0 : 1);
//		ll c = CurrentA / A[i] + (CurrentA % A[i] == 0 ? 0 : 1);
//
//		ll k = max(b, c);
//
//		CurrentT = k * T[i];
//		CurrentA = k * A[i];
//
//		P[i] = CurrentT + CurrentA;
//	}
//}
//
//cout << P[N - 1] << endl;

Submission Info

Judge Result