Submission #4083678

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<long long> A(N);
    vector<long long> B(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i] >> B[i];
    }

    reverse(A.begin(), A.end());
    reverse(B.begin(), B.end());
    long long ans = 0;
    for (int i = 0; i < N - 1; i++) {
        if (B[i] != 1 && A[i] % B[i] == 0) {
            ans += B[i] - A[i] % B[i];
        }
        A[i + 1] += ans;
    }
    if (B[N - 1] != 1 && A[N - 1] % B[N - 1] != 0) {
        ans += B[N - 1] - A[N - 1] % B[N - 1];
    }
    cout << ans << endl;
}

Submission Info

Judge Result