Submission #5492979
Source Code Expand
#include <algorithm> #include <iostream> #include <iomanip> #include <cstring> #include <cstdlib> #include <utility> #include <cstdio> #include <vector> #include <string> #include <queue> #include <stack> #include <cmath> #include <set> #include <map> using ll = long long; using itn = int; using namespace std; int GCD(int a, int b){ return b ? GCD(b, a%b) : a; } int main() { int n; cin >> n; ll a[n],b[n]; for(int i=0; i<n; i++){ cin >> a[i] >> b[i]; } ll cnt=0; for(int i=n-1; i>=0; i--){ a[i]+=cnt; if(a[i] % b[i]){ if(a[i]<b[i]){ swap(a[i],b[i]); } if(a[i]/b[i] -1){ cnt+=b[i]-a[i]%b[i]; }else{ cnt+=a[i]%b[i]; } } } cout << cnt << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | walt |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 867 Byte |
Status | WA |
Exec Time | 86 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 80 ms | 1792 KB |
02.txt | AC | 80 ms | 1792 KB |
03.txt | AC | 81 ms | 1792 KB |
04.txt | AC | 82 ms | 1792 KB |
05.txt | AC | 81 ms | 1792 KB |
06.txt | AC | 80 ms | 1792 KB |
07.txt | AC | 57 ms | 1792 KB |
08.txt | WA | 85 ms | 1792 KB |
09.txt | AC | 58 ms | 1792 KB |
10.txt | AC | 84 ms | 1792 KB |
11.txt | AC | 56 ms | 1792 KB |
12.txt | AC | 34 ms | 1792 KB |
13.txt | WA | 58 ms | 1792 KB |
14.txt | AC | 86 ms | 1792 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 1 ms | 256 KB |
s1.txt | WA | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |