Submission #1073739
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <cmath> #define ll long long int #define mod 1000000007 #define fr(n) for (int i = 0; i < n; i++) #define fr1(n) for (int i = 1; i <= n; i++) using namespace std; int main() { ios::sync_with_stdio(false); ll n, a[100005] = {}, b[100005] = {}, z = 0; cin >> n; fr(n) cin >> a[i] >> b[i]; for (ll i = n - 1; i >= 0; i--) { a[i] += z; if (a[i] % b[i] != 0) z += b[i] - a[i] % b[i]; //cout << z << ' '; } cout << z << '\n'; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | Jeffrey |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 582 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 1920 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 | 1920 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 | 21 ms | 1920 KB |
08.txt | AC | 27 ms | 1792 KB |
09.txt | AC | 22 ms | 1920 KB |
10.txt | AC | 27 ms | 1920 KB |
11.txt | AC | 21 ms | 1792 KB |
12.txt | AC | 16 ms | 1792 KB |
13.txt | AC | 21 ms | 1792 KB |
14.txt | AC | 27 ms | 1920 KB |
15.txt | AC | 4 ms | 1792 KB |
16.txt | AC | 4 ms | 1792 KB |
s1.txt | AC | 4 ms | 1792 KB |
s2.txt | AC | 4 ms | 1792 KB |