Submission #928743

---

Source Code Expand

//#include "IntMod.h"
//typedef IntMod<1000000007> MInt;

#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,a,n) for(int i = a; i < n; ++i)
#define EPS 0.0001
#define INF 0x3FFFFFFF
typedef long long LL;

int N;
LL a = 1, b = 1;

int main() {
	cin >> N;
	REP(i, 0, N) {
		LL bufa, bufb;
		cin >> bufa >> bufb;
		int mul;
		if (a * bufb >= b * bufa) {
			mul = (a - 1) / bufa + 1;
		} else {
			mul = (b - 1) / bufb + 1;
		}
		a = mul * bufa;
		b = mul * bufb;
	}
	cout << a + b << endl;
	return 0;
}

Submission Info

Judge Result