Submission #1073877

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define err(x) cout<<#x<<"= "<<x<<endl;
#define FOR(i,a,b) for(int i =a; i< b; ++i)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define INF 1000000000
#define TRVI(it,it1,it2) for(vi::iterator it = it1; it!= it2; it++)
#define ff first
#define ss second
#define mp make_pair
#define pq priority_queue<int, vector<int>, greater<int> >
#define ll long long
const ll PR = 1000000009;
#define SIZE 1
#define vi vector<ll>
#define pii pair<int,int>
#define endl '\n'

int main(){
//	#ifdef ONLINE_JUDGE
//	freopen("a.in", "r" , stdin);
//	freopen("a.out", "w", stdout);
//      cin.tie(false); cout.tie(false);	
//	#endif
	ios::sync_with_stdio(false);
	ll n;
	vi A,B;
	cin>>n;
	for(int i =0; i< n; i++){
		int a,b;
		cin>>a>>b;
		A.pb(a);
		B.pb(b);
	}
	ll ans =0;
	for(int i = n-1; i>= 0; i--){
		ll now = A[i]+ans;
		ll rem = B[i] - now%B[i];
		if(rem == B[i])rem = 0;
		ans+= rem;
//		cout<<now<<' '<<B[i]<<' '<<rem<<endl;
	}
	cout<<ans<<endl;
	return 0;
};

Submission Info

Judge Result