Submission #1074506

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e9 + 7;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second

int n;
ll a[100100], b[100100];

int main(){
	ll ans = 0, buf = 0;
	cin >> n;
	REP(i, n){
		cin >> a[i] >> b[i];
	}
	for (int i = n - 1; i >= 0; i--){
		if (b[i] == 1)continue;
		if (a[i] % b[i] == 0)continue;
		ans += ((a[i] + buf) / b[i] + 1)*b[i] - (a[i] + buf);
		buf = ans;
	}
	cout << ans << endl;
}

Submission Info

Judge Result