提出 #928240

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
#include <ctime>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define pb push_back
#define mp make_pair
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
#define println(X) cout<<X<<endl;
#define DBG(X) cout<<#X<<" : "<<X<<endl;
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;
const double PI = acos(-1);

int main(){
	int n;
	cin>>n;
	vl t(n), a(n);
	rep(i, n) cin>>t[i]>>a[i];
	ll ans = t[0]+a[0];
	ll aa = a[0], tt = t[0];
	REP(i, 1, n){
		// ll k = 1LL;
		// while(k*a[i] < aa || k * t[i] < tt) k++;
		ll k = max((aa-1)/a[i]+1LL, (tt-1)/t[i]+1LL);
		aa = a[i]*k;
		tt = t[i]*k;
	}
	ans = aa+tt;
	cout<<ans<<endl;
}

提出情報

ジャッジ結果