Submission #929448

---

Source Code Expand

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <unordered_map>
#include <list>
#include <string>
#include <limits.h>
#include <set>
using namespace std;
#define ll long long int


int main(){
	int N;
	cin>>N;
	int i,j,k;
	vector<pair<int,int>> v(N);
	for(i=0;i<N;i++){
		int x,y;
		cin>>x>>y;
		v[i]=make_pair(x,y);
	}

	long long int res=0;
	res+=(v[0].first+v[0].second);
	for(i=1;i<N;i++){
		if(v[i].first<v[i-1].first||v[i].second<v[i-1].second){
			long long int a=v[i-1].first/v[i].first;
			long long int b=v[i-1].second/v[i].second;
			if(v[i-1].first%v[i].first!=0&&v[i-1].first>v[i].first) a++;
			if(v[i-1].second%v[i].second!=0&&v[i-1].second>v[i].second) b++;
			a=max(a,b);
			v[i].first*=a;
			v[i].second*=a;
		}
	}
	res=v.back().first+v.back().second;
	cout<<res<<endl;
	return 0;
}

Submission Info

Judge Result