Submission #1073725

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#include<fstream>

#define rep(i,a,N) for(int i=0+a;i<N;i++)
#define lint long long int
#define SIZE 100005
#define pb push_back
#define MP make_pair

using namespace std;

int main(){
	lint a[SIZE],b[SIZE];
	lint n,ans=0;
	cin>>n;
	rep(i,0,n){
		cin>>a[i]>>b[i];
	}
	for(int i=n-1;i>=0;i--){
		if((a[i]+ans)%b[i]!=0){
			ans+=b[i]-(a[i]+ans)%b[i];
		}
	}
	cout<<ans;

return 0;
}

Submission Info

Judge Result