Submission #1304607

---

Source Code Expand

#include <iostream>
#include <math.h>
using namespace std;

int main(){
  long long int N;
  cin >> N;
  long long int T[N], A[N];
  for(int i = 0; i < N; ++i){
    cin >> T[i] >> A[i];
  }
  long long int ans1 = T[0];
  long long int ans2 = A[0];
  for(int i = 0; i < N-1; ++i){
    if(ans1 <= T[i+1] && ans2 <= A[i+1]){
      ans1 = T[i+1];
      ans2 = A[i+1];
    }
    else{
    int j = max(ans1 / T[i+1], ans2 / A[i+1]);
    if(max(ans1 / T[i+1], ans2 / A[i+1]) == ans1 / T[i+1] && ans1 % T[i+1] !=0)
    {j = j + 1;}
  if(max(ans1 / T[i+1], ans2 / A[i+1]) == ans2 / A[i+1] && ans2 % A[i+1] != 0)
    {j = j + 1;}
        ans1 = T[i+1]*j;
        ans2 = A[i+1]*j;
    }    
      }

  cout << ans1 + ans2 << endl;
  return 0;
}

Submission Info

Judge Result