Submission #1074388

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <fstream>
#include <vector>
#include <deque>
#include <assert.h>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <stdio.h>
#include <string.h>
#include <utility>
#include <math.h>
#include <bitset>
#include <iomanip>

using namespace std;

#define F(i , a , b) for(int (i) = (a) ; (i) <= (b) ; (i)++)
#define pb push_back
#define ll long long
#define E(a) cerr << #a << " = " << a << '\n'
#define X first
#define Y second
#define INF 10000000000000
#define int long long
const int MAX_N = 100000 + 10 , mod = 1000000007;

ll n,a[MAX_N],b[MAX_N],num;

int32_t main(){
    
    //    freopen("input.txt" , "r" , stdin);
    //    freopen("output.txt" , "w" , stdout);
    //    cout << setprecision(10) << fixed;
    ios::sync_with_stdio(0); cin.tie() ; cout.tie();
    
    cin >> n;
    for(int i=0 ; i<n; i++){
    	cin >>a[i] >> b[i];
    }
    for(int i = n-1; i+1 ;i--){
    	a[i] += num;
    	num += b[i]*ceil(1.0*a[i]/b[i]) - a[i];
    	a[i] = b[i]*ceil(1.0*a[i]/b[i]);
    }
    cout << num;
    
    
    
    
    
    
    
    
    return 0;
}

Submission Info

Judge Result