Submission #1073403
Source Code Expand
#include<iostream> #include<cstdio> #include<algorithm> #include<set> #include<map> #include<queue> #include<cassert> #define PB push_back #define MP make_pair #define sz(v) (in((v).size())) #define forn(i,n) for(in i=0;i<(n);++i) #define forv(i,v) forn(i,sz(v)) #define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i) #define all(v) (v).begin(),(v).end() using namespace std; typedef long long in; typedef vector<in> VI; typedef vector<VI> VVI; VI a,b; int main(){ ios::sync_with_stdio(0); cin.tie(0); in n; cin>>n; a=b=VI(n); forn(z,n){ cin>>a[z]>>b[z]; } in sm=0; for(in i=n-1;i>=0;--i){ a[i]+=sm; a[i]%=b[i]; if(a[i]) sm+=b[i]-a[i]; } cout<<sm<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | w4yneb0t |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 754 Byte |
Status | AC |
Exec Time | 28 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 | 27 ms | 1792 KB |
02.txt | AC | 27 ms | 1792 KB |
03.txt | AC | 27 ms | 1792 KB |
04.txt | AC | 27 ms | 1792 KB |
05.txt | AC | 27 ms | 1792 KB |
06.txt | AC | 27 ms | 1792 KB |
07.txt | AC | 21 ms | 1792 KB |
08.txt | AC | 27 ms | 1792 KB |
09.txt | AC | 22 ms | 1792 KB |
10.txt | AC | 27 ms | 1792 KB |
11.txt | AC | 21 ms | 1792 KB |
12.txt | AC | 17 ms | 1792 KB |
13.txt | AC | 21 ms | 1792 KB |
14.txt | AC | 28 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 |