Submission #929482

---

Source Code Expand

#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<functional>
#include<utility>
#include<bitset>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<cstdio>

using namespace std;

#define REP(i,n) for(int i=0;i<int(n);i++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
typedef long long ll;
typedef pair<int,int> P;

ll t[1010],a[1010];

int main(void){
	int i;

	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int N;
	cin >> N;
	for(i=1;i<=N;i++){
		cin >> t[i] >> a[i];
	}

	for(i=2;i<=N;i++){
		ll x=(t[i-1]+t[i]-1)/t[i],y=(a[i-1]+a[i]-1)/a[i];
		ll d=max(x,y);
		t[i]=d*t[i];
		a[i]=d*a[i];
	}

	cout << t[N]+a[N] << endl;

	return 0;
}

Submission Info

Judge Result