Submission #1569822
Source Code Expand
#include "bits/stdc++.h" using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define REP(i,x,n) for(int i=x;i<n;i++) #define ALL(v) (v).begin(),(v).end() #define MP(a,b) make_pair(a,b) typedef long long LL; typedef pair<int, int> PI; typedef vector<int> VI; const LL MOD = 1000000007LL; int A[100000]; int B[100000]; int main() { int N; cin >> N; rep(i, N) { cin >> A[i] >> B[i]; } LL sum = 0; for (int i = N - 1; i >= 0; i--) { sum += (B[i] - (sum + A[i]) % B[i]) % B[i]; } cout << sum << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | Div9851 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 539 Byte |
Status | AC |
Exec Time | 116 ms |
Memory | 1024 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 | 106 ms | 1024 KB |
02.txt | AC | 108 ms | 1024 KB |
03.txt | AC | 106 ms | 1024 KB |
04.txt | AC | 108 ms | 1024 KB |
05.txt | AC | 106 ms | 1024 KB |
06.txt | AC | 108 ms | 1024 KB |
07.txt | AC | 74 ms | 1024 KB |
08.txt | AC | 113 ms | 1024 KB |
09.txt | AC | 73 ms | 1024 KB |
10.txt | AC | 113 ms | 1024 KB |
11.txt | AC | 73 ms | 1024 KB |
12.txt | AC | 42 ms | 1024 KB |
13.txt | AC | 74 ms | 1024 KB |
14.txt | AC | 116 ms | 1024 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 |