Submission #1073879
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
// #define DEBUG
#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);
int main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
vll a(n), b(n);
rep(i, n){
cin >> a[i] >> b[i];
}
ll res = 0;
rrep(i, n){
a[i] += res;
if(a[i] == 0 or b[i] == 1 or a[i] % b[i] == 0) continue;
res += (b[i] - a[i] % b[i]);
}
cout << res << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Multiple Array |
User |
nokoTaro |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2141 Byte |
Status |
AC |
Exec Time |
27 ms |
Memory |
1792 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
26 ms |
1792 KB |
02.txt |
AC |
26 ms |
1792 KB |
03.txt |
AC |
26 ms |
1792 KB |
04.txt |
AC |
26 ms |
1792 KB |
05.txt |
AC |
26 ms |
1792 KB |
06.txt |
AC |
26 ms |
1792 KB |
07.txt |
AC |
19 ms |
1792 KB |
08.txt |
AC |
26 ms |
1792 KB |
09.txt |
AC |
20 ms |
1792 KB |
10.txt |
AC |
27 ms |
1792 KB |
11.txt |
AC |
20 ms |
1792 KB |
12.txt |
AC |
15 ms |
1792 KB |
13.txt |
AC |
21 ms |
1792 KB |
14.txt |
AC |
27 ms |
1792 KB |
15.txt |
AC |
2 ms |
256 KB |
16.txt |
AC |
2 ms |
256 KB |
s1.txt |
AC |
2 ms |
256 KB |
s2.txt |
AC |
2 ms |
256 KB |