Submission #1322380

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
using namespace std;
#define INF 1<<21
#define DIV 1000000007

int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 };

int main() {
  int n;
  int a[100000], b[100000];
  int cnt=0;
  cin >> n;
  for (int i = 1; i <= n; i++) {
	cin >> a[i] >> b[i];
  }
  for (int i = n ; i >= 1; i--) {
	while (a[i] % b[i] != 0) {
	  for (int j = 1; j <= i; j++) {
		a[j]++;
	  }
	  cnt++;
	}
  }
  cout << cnt << endl;
}

Submission Info

Judge Result