Submission #2177842

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using P = pair<int, int>;

const int INF = 1e9;
const int MOD = 1e9 + 7;

// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int main() {
  // 入力
  int N;
  cin >> N;
  int a[N], b[N];
  for (int i = 0; i < N; i++) cin >> a[i] >> b[i];

  // N項目から決めていく
  ll ans = 0;
  for (int i = N - 1; i >= 0; i--) {
    if (a[i] + ans < b[i]) {
      ans += b[i] - (a[i] + ans);
    } else if (a[i] + ans > b[i]) {
      if ((a[i] + ans) % b[i] != 0) {
        int s = (a[i] + ans) / b[i];
        ans += (s + 1) * b[i] - (a[i] + ans);
      }
    }
  }

  // 解答
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result