Submission #1074370

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <string>
using namespace std;

int main()
{
	int N = 0;
	cin >> N;
	long long A[N], B[N];
	for(int i = 0; i < N; i++){
		cin >> A[i] >> B[i];
	}
	long long count = 0;
	for(int i = N - 1; i >= 0; i--){
		A[i] += count;
		if(!(A[i] % B[i])){
			;
		}else{
			int quot = A[i] / B[i];
			count += B[i] * (quot + 1) - A[i];
		}
	}
	cout << count << endl;

	return 0;
}

Submission Info

Judge Result