Submission #1073380
Source Code Expand
/* */ #pragma GCC optimize("O3") #define _CRT_SECURE_NO_WARNINGS #include <fstream> #include <iostream> #include <string> #include <complex> #include <math.h> #include <set> #include <vector> #include <map> #include <queue> #include <stdio.h> #include <stack> #include <algorithm> #include <list> #include <ctime> #include <memory.h> #include <assert.h> #define y0 sdkfaslhagaklsldk #define y1 aasdfasdfasdf #define yn askfhwqriuperikldjk #define j1 assdgsdgasghsf #define tm sdfjahlfasfh #define lr asgasgash #define norm asdfasdgasdgsd #define have adsgagshdshfhds #define ends asdgahhfdsfshdshfd #define eps 1e-9 #define M_PI 3.141592653589793 #define bs 1000000007 #define bsize 512 #define ldouble long double using namespace std; const int N = 1000031; long long n,a[N],b[N]; long long cur_moves; int main(){ //freopen("tree.in","r",stdin); //freopen("tree.out","w",stdout); //freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios_base::sync_with_stdio(0); //cin.tie(0); cin>>n; for (int i=1;i<=n;i++) { cin>>a[i]>>b[i]; } for (int i=n;i>=1;--i) { long long cur_val=a[i]+cur_moves; long long cur_rem=cur_val%b[i]; if (cur_rem!=0) cur_moves+=b[i]-cur_rem; } cout<<cur_moves<<endl; cin.get(); cin.get(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Multiple Array |
User | LeBron |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1350 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 1792 KB |
Compile Error
./Main.cpp:36:0: warning: "M_PI" redefined #define M_PI 3.141592653589793 ^ In file included from /usr/include/c++/5/cmath:44:0, from /usr/include/c++/5/complex:44, from ./Main.cpp:9: /usr/include/math.h:372:0: note: this is the location of the previous definition # define M_PI 3.14159265358979323846 /* pi */ ^
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 | 384 KB |
16.txt | AC | 3 ms | 256 KB |
s1.txt | AC | 3 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |