Submission #928301

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring> 
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
 
using namespace std;

#define mod 1000000007


int main()
{
    int n;
    cin >> n;
    long long int t[1001], a[1001];
    for(int i = 0; i < n; i++){
        cin >> t[i] >> a[i];
    }
    long long int takahashi = t[0], aoki = a[0];
    for(int i = 1; i < n; i++){
        if(takahashi % t[i] != 0) takahashi += t[i] - (takahashi % t[i]);
        if(aoki % a[i] != 0) aoki += a[i] - (aoki % a[i]);
        while(takahashi * a[i] != aoki * t[i]){
            if(takahashi * a[i] > aoki * t[i]) aoki += a[i];
            else takahashi += t[i];
        }
    }
    cout << takahashi + aoki << endl;
    return 0;
}

Submission Info

Judge Result