Submission #1302829
Source Code Expand
#define _USE_MATH_DEFINES
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 30;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int64 a[N], b[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lld%lld", &a[i], &b[i]);
}
int64 ret = 0;
for (int i = n - 1; i >= 0; --i) {
a[i] += ret;
ret += (a[i] + b[i] - 1) / b[i] * b[i] - a[i];
}
printf("%lld\n", ret);
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Multiple Array |
User |
cuiaoxiang |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
1281 Byte |
Status |
AC |
Exec Time |
24 ms |
Memory |
1792 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:46:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:48:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld", &a[i], &b[i]);
^
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 |
23 ms |
1792 KB |
02.txt |
AC |
23 ms |
1792 KB |
03.txt |
AC |
23 ms |
1792 KB |
04.txt |
AC |
23 ms |
1792 KB |
05.txt |
AC |
24 ms |
1792 KB |
06.txt |
AC |
23 ms |
1792 KB |
07.txt |
AC |
19 ms |
1792 KB |
08.txt |
AC |
24 ms |
1792 KB |
09.txt |
AC |
19 ms |
1792 KB |
10.txt |
AC |
24 ms |
1792 KB |
11.txt |
AC |
19 ms |
1792 KB |
12.txt |
AC |
15 ms |
1792 KB |
13.txt |
AC |
19 ms |
1792 KB |
14.txt |
AC |
24 ms |
1792 KB |
15.txt |
AC |
1 ms |
256 KB |
16.txt |
AC |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |