Submission #1074371
Source Code Expand
//satyaki3794 #include <bits/stdc++.h> #define ff first #define ss second #define pb push_back #define MOD (1000000007LL) #define LEFT(n) (2*(n)) #define RIGHT(n) (2*(n)+1) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> ii; typedef pair<int, ii> iii; ll pwr(ll base, ll p, ll mod = MOD){ ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans; } ll gcd(ll a, ll b){ if(b == 0) return a; return gcd(b, a%b); } int n; ll a[100005], b[100005]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]>>b[i]; } ll ans = 0; for(int i=n;i>=1;i--){ ll val = a[i]+ans; if(val % b[i] != 0) ans += b[i] - val%b[i]; } cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | satyaki3794 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 899 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 | 2 ms | 256 KB |
s1.txt | AC | 2 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |