Submission #1590105


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define PI 4*atan(1)
#define INF 1e8

typedef long long ll;

int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};

int main(){
  ll N;
  cin >> N;
  vector<ll> A(N), B(N);
  for(int i = 0; i < N; i++)cin >> A[i] >> B[i];
  ll cnt = 0;
  for(int i = N - 1; i >= 0; i--){
    A[i] += cnt;
    ll t = A[i] % B[i];
    if(A[i] == 0)cnt += B[i];
    else if(B[i] != 1)cnt += (B[i] - t);
    
  }
  cout << cnt << endl;
}

Submission Info

Submission Time
Task A - Multiple Array
User yuta0802
Language C++14 (GCC 5.4.1)
Score 0
Code Size 484 Byte
Status WA
Exec Time 87 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
AC × 11
WA × 7
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 81 ms 1792 KB
02.txt AC 81 ms 1792 KB
03.txt AC 81 ms 1792 KB
04.txt AC 81 ms 1792 KB
05.txt AC 81 ms 1792 KB
06.txt AC 81 ms 1792 KB
07.txt AC 56 ms 1792 KB
08.txt AC 84 ms 1792 KB
09.txt WA 59 ms 1792 KB
10.txt AC 84 ms 1792 KB
11.txt WA 58 ms 1792 KB
12.txt WA 34 ms 1792 KB
13.txt WA 58 ms 1792 KB
14.txt WA 87 ms 1792 KB
15.txt WA 1 ms 256 KB
16.txt WA 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB