Submission #1649589

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

int main(void) {
	int n;
	int t[1001], a[1001];
	long long int p, q;

	cin >> n;
	FOR(i, 1, n) {
		cin >> t[i] >> a[i];
	}
	p = t[1];
	q = a[1];

	FOR(i, 2, n) {
		FOR(s,1, 10000000) {
			if (s*t[i] >= p&&s*a[i] >= q) {
				p = s*t[i];
				q = s*a[i];
				break;
			}
		}
	}

	cout << p + q << endl;
	return 0;
}

Submission Info

Judge Result