Submission #1074368
Source Code Expand
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cstdlib> #include<queue> #include<cmath> #include<stack> #include<set> #include<map> #include<vector> using namespace std; #define INF 0x3f3f3f3f #define gc getchar() typedef long long ll; int read() { char c=gc;int u=0,f=1; while(c!='-' && (c<'0' || '9'<c))c=gc; if(c=='-'){ f=-1; c=gc; } while('0'<=c && c<='9'){ u=u*10+c-'0'; c=gc; } return u*f; } inline int max(int a,int b){return a>b?a:b;} inline int min(int a,int b){return a<b?a:b;} inline void swap(int &a,int &b){int t=a;a=b;b=t;} ll a[100010],b[100010]; ll ans=0; int main() { int n=read(); for(int i=1;i<=n;i++){ a[i]=read(); b[i]=read(); } for(int i=n;i>=1;i--){ a[i]+=ans; if(a[i]%b[i])ans+=b[i]-(a[i]%b[i]); } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | fgvfgfg1 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 873 Byte |
Status | AC |
Exec Time | 22 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 | 21 ms | 1792 KB |
02.txt | AC | 21 ms | 1792 KB |
03.txt | AC | 21 ms | 1792 KB |
04.txt | AC | 22 ms | 1792 KB |
05.txt | AC | 21 ms | 1792 KB |
06.txt | AC | 21 ms | 1792 KB |
07.txt | AC | 14 ms | 1792 KB |
08.txt | AC | 22 ms | 1792 KB |
09.txt | AC | 15 ms | 1792 KB |
10.txt | AC | 22 ms | 1792 KB |
11.txt | AC | 14 ms | 1792 KB |
12.txt | AC | 9 ms | 1792 KB |
13.txt | AC | 15 ms | 1792 KB |
14.txt | AC | 22 ms | 1792 KB |
15.txt | AC | 3 ms | 256 KB |
16.txt | AC | 3 ms | 384 KB |
s1.txt | AC | 3 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |