Submission #1076449

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <string>
#include <sstream>
#include <math.h>
#include <set>
#include <map>
using namespace std;
#define rep(i,n) for(int i = 0; i < n ; i++)
#define pb push_back
static const int INF = 1000000;
static const int MAX = 100000;

typedef pair<int, int> P;
typedef pair<P, int> PP;

int main(void){
  int N; cin >> N;
  long long int a[MAX],b[MAX];
  long long int x,y;
  rep(i,N){
    cin >> x >> y;
    a[i] = x; b[i] = y;
  }
  float result = 0;
  long long int res = 0;
  for(int i = N - 1; i >= 0; i--){

    //cout << ceil((a[i] + result) / b[i]) << endl;
    //cout << b[i] << " " << a[i] <<endl;

    res = (ceil(((float)a[i] + (float)res) / (float)b[i]) * b[i]) - a[i];

    //cout << "i = " << i << " " << result << endl;

  }

  cout << res << endl;

  return 0;
}

Submission Info

Judge Result