Submission #1304051

---

Source Code Expand

import std.algorithm;
import std.array;
import std.ascii;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;
void log(A...)(A arg) { stderr.writeln(arg); }
int size(T)(in T s) { return cast(int)s.length; }

void main() {
    int N; readf("%d\n", &N);
    long a = 1, t = 1;
    foreach (i; 0 .. N) {
        long b, u; readf("%s %s\n", &b, &u);
        long k = 1;
        if (a > b) {
            k = max(k, (a + b - 1) / b);
        }
        if (t > u) {
            k = max(k, (t + u - 1) / u);
        }
        a = b * k;
        t = u * k;
    }
    writeln(a + t);
}

Submission Info

Judge Result