Submission #1073408
Source Code Expand
#include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; int n; vector<long long> a, b; void Solve() { long long add = 0; for (int i = n - 1; i >= 0; --i) { long long cur = a[i] + add; long long rem = cur % b[i]; if (rem != 0) { add += (b[i] - rem); } } cout << add << endl; } bool Read() { if (!(cin >> n)) { return false; } a.resize(n); b.resize(n); for (int i = 0; i < n; ++i) { cin >> a[i] >> b[i]; } return true; } int main() { // freopen("input.txt", "r", stdin); ios_base::sync_with_stdio(false); cin.tie(nullptr); while (Read()) { Solve(); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | bidzilya |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 791 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 | 20 ms | 1792 KB |
08.txt | AC | 26 ms | 1792 KB |
09.txt | AC | 21 ms | 1792 KB |
10.txt | AC | 26 ms | 1792 KB |
11.txt | AC | 20 ms | 1792 KB |
12.txt | AC | 16 ms | 1792 KB |
13.txt | AC | 21 ms | 1792 KB |
14.txt | AC | 27 ms | 1792 KB |
15.txt | AC | 3 ms | 256 KB |
16.txt | AC | 3 ms | 256 KB |
s1.txt | AC | 3 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |