Submission #2180961
Source Code Expand
#include<bits/stdc++.h> #define REP(i,s,n) for(int i=s;i<n;++i) #define rep(i,n) REP(i,0,n) #define ALL(x) x.begin(),x.end() #define EPS (1e-8) #define equals(a,b) (fabs((a)-(b))<EPS) using namespace std; typedef long long ll; const int IINF = INT_MAX; const ll LLINF = LLONG_MAX; bool LT(double a,double b) { return !equals(a,b) && a < b; } bool LTE(double a,double b) { return equals(a,b) || a < b; } void compute() { } int main() { int n; cin >> n; vector<ll> A(n), B(n); rep(i,n) cin >> A[i] >> B[i]; ll ans = 0, base = 0; for(int i=n-1;i>=0;--i) { ll v = ( A[i] + base ) % B[i]; if( v ) v = B[i] - v; ans += v; base += v; } cout << ans << endl; compute(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | TenkoChabashira |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 753 Byte |
Status | AC |
Exec Time | 87 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 | 81 ms | 1792 KB |
02.txt | AC | 80 ms | 1792 KB |
03.txt | AC | 80 ms | 1792 KB |
04.txt | AC | 80 ms | 1792 KB |
05.txt | AC | 80 ms | 1792 KB |
06.txt | AC | 80 ms | 1792 KB |
07.txt | AC | 57 ms | 1792 KB |
08.txt | AC | 84 ms | 1792 KB |
09.txt | AC | 58 ms | 1792 KB |
10.txt | AC | 84 ms | 1792 KB |
11.txt | AC | 57 ms | 1792 KB |
12.txt | AC | 35 ms | 1792 KB |
13.txt | AC | 58 ms | 1792 KB |
14.txt | AC | 87 ms | 1792 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |