Submission #5492849

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>
using ll = long long;
using itn = int;
using namespace std;
int GCD(int a, int b){
    return b ? GCD(b, a%b) : a;
}
int main() {
    int n;
    cin >> n;
    ll a[n],b[n];
    for(int i=0; i<n; i++){
        cin >> a[i] >> b[i];
    }
    ll cnt=0;
    for(int i=n-1; i>=0; i--){
        a[i]+=cnt;
        if(a[i] % b[i]){
            if(a[i]<b[i]){
                swap(a[i],b[i]);
            }
            cnt+=b[i]-a[i]%b[i];
        }
        
    }
    cout << cnt << endl;
}

Submission Info

Judge Result