Submission #1316571

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int N;
ll T[1001],A[1001];

int main() {
  cin >> N;

  for(int i = 0; i < N; i++) cin >> T[i] >> A[i];

  for(int i = 1; i < N; i++) {
    if(T[i-1] <= T[i] && A[i-1] <= A[i]) continue;
    else if(T[i-1] > T[i] && A[i-1] <= A[i]) {
      ll tmp = 0;
      if(T[i-1] % T[i] != 0) tmp++;
      tmp += T[i-1] / T[i];
      T[i] *= tmp;
      A[i] *= tmp;
   
    }
    else if(A[i-1] > A[i] && T[i-1] <= T[i]) {
      ll tmp = 0;
      if(A[i-1] % A[i] != 0) tmp++;
      tmp += A[i-1] / A[i];
      T[i] *= tmp;
      A[i] *= tmp;
    }
    
    else {
      if(T[i-1] / T[i] > A[i-1] / A[i]) {
	ll tmp = 0;
	if(T[i-1] % T[i] != 0) tmp++;
	tmp += T[i-1] / T[i];
	T[i] *= tmp;
	A[i] *= tmp;
      }
      else {
	ll tmp = 0;
	if(A[i-1] % A[i] != 0) tmp++;
	tmp += A[i-1] / A[i];
	A[i] *= tmp;
	T[i] *= tmp;
      }
    }
  }
  cout << T[N-1] + A[N-1] <<endl;
}
       

Submission Info

Judge Result