Submission #1330928

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;
	vector<LL> A(N),B(N);
	for(int i=0;i<N;++i){
		cin >> A[i] >> B[i];//比
	}
	////////
	LL L,R;
	L = 1;
	R = 1;
	/*
	L/R = A/B
	L*B = R*A
	LはAの倍数
	RはBの倍数
	xAB ? yAB
	x,yの最小値を求めて
	L = max(x,y) * A
	R = max(x,y) * B
	*/
	for(int i=0;i<N;++i){
		LL X,Y;
		//L*A*B ? R*A*Bを作って
		//係数を大きいほうへ一致させる
		X = (L+A[i]-1)/A[i];
		Y = (R+B[i]-1)/B[i];
		
		L = max(X,Y) * A[i];
		R = max(X,Y) * B[i];
		//cout << L << " " << R << endl;
	}
	cout << L + R << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result