Submission #1073421
Source Code Expand
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET int ___T, case_n = 1; scanf("%d ", &___T); while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<pair<int,int> >
#define PLL pair<long long,long long>
#define VPLL vector<pair<long long,long long> >
#define F first
#define S second
typedef long long LL;
using namespace std;
const int MOD = 1e9+7;
const int SIZE = 1e6+10;
int a[SIZE],b[SIZE];
int main(){
DRI(N);
REP(i,N)RII(a[i],b[i]);
LL an=0;
for(int i=N-1;i>=0;i--){
a[i]+=an;
an+=(((a[i]+b[i]-1)/b[i])*b[i])-a[i];
}
cout<<an<<endl;
return 0;
}
Submission Info
Submission Time
2017-01-22 21:03:32+0900
Task
A - Multiple Array
User
dreamoon
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1302 Byte
Status
WA
Exec Time
26 ms
Memory
1024 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:32:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
DRI(N);
^
./Main.cpp:33:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,N)RII(a[i],b[i]);
^
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
WA
25 ms
1024 KB
02.txt
WA
25 ms
1024 KB
03.txt
WA
25 ms
1024 KB
04.txt
WA
25 ms
1024 KB
05.txt
WA
25 ms
1024 KB
06.txt
WA
25 ms
1024 KB
07.txt
AC
20 ms
1024 KB
08.txt
WA
25 ms
1024 KB
09.txt
AC
21 ms
1024 KB
10.txt
WA
25 ms
1024 KB
11.txt
AC
20 ms
1024 KB
12.txt
AC
16 ms
1024 KB
13.txt
WA
20 ms
1024 KB
14.txt
AC
26 ms
1024 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