Submission #3711381

---

Source Code Expand

#if !defined(__clang__) && defined(__GNUC__)
#include <bits/stdc++.h>
#else
#include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <regex>
#endif //  !defined(__clang__) && defined(__GNUG__)
#include <boost/lexical_cast.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/multi_array.hpp>
#include <boost/optional.hpp>
#include <boost/math/common_factor_rt.hpp>  // https://boostjp.github.io/tips/math.html
#include <boost/dynamic_bitset.hpp>  // https://boostjp.github.io/tips/dynamic_bitset.html

constexpr int64_t DIV1097 = 1000000007LL;

using namespace std;

int main()
{
    int64_t N;
    std::cin >> N;

    int64_t T, A;
    T = A = 1;
    for (decltype(N) i = 0; i < N; ++i) {
        int t, a;
        std::cin >> t >> a;

        int64_t k;
        k = std::min(T/t, A/k);
        for (;; ++k) {
            if (k*t >= T && k*a >= A) {
                T = k*t;
                A = k*a;
                break;
            }
        }
    }

    std::cout << T + A << std::endl;

    return 0;
}

Submission Info

Judge Result