Submission #1307305

---

Source Code Expand

#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int inf = 999999999;
const double pi = acos(-1);

#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))
#define rsort(a,b,c) sort(a, b, greater<c>())

ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}

///////////////////////////////////////////////////////////////////////////
pair<ll,ll> p[100005] = {};

int main(){
	int n;
	cin >> n;
	ll cnt = 0;

    rep(i,0,n)cin >> p[n-1-i].first >> p[n-1-i].second;
    
	rep(i,0,n){
       ll a = p[i].first,b = p[i].second;
       //cout << a+cnt << " " << b <<  " " ;
       if( a+cnt < b){
            cnt += b-a-cnt;
       }else{
            if((a+cnt)%b != 0){
                
                cnt += b-((a+cnt)%b);  
            }
       } 
       //cout << cnt << endl;
	}

	cout <<cnt << endl;
	
	return 0;
}

Submission Info

Judge Result