Submission #1073546


Source Code Expand

var n,i,j:longint;
    ans,now:int64;
	a,b:array[0..100007] of longint;
begin
  readln(n);
  for i:=1 to n do
	readln(a[i],b[i]);
  ans:=0;
  for i:=n downto 1 do
  begin
    now:=(b[i]-(a[i]+ans) mod b[i]) mod b[i];
    ans:=ans+now;
  end;
  writeln(ans);
end.
	

Submission Info

Submission Time
Task A - Multiple Array
User Tommyr7
Language Pascal (FPC 2.6.2)
Score 300
Code Size 279 Byte
Status AC
Exec Time 46 ms
Memory 896 KB

Compile Error

/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 18
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 42 ms 896 KB
02.txt AC 42 ms 896 KB
03.txt AC 42 ms 896 KB
04.txt AC 42 ms 896 KB
05.txt AC 42 ms 896 KB
06.txt AC 42 ms 896 KB
07.txt AC 30 ms 896 KB
08.txt AC 44 ms 896 KB
09.txt AC 30 ms 896 KB
10.txt AC 44 ms 896 KB
11.txt AC 30 ms 896 KB
12.txt AC 18 ms 896 KB
13.txt AC 30 ms 896 KB
14.txt AC 46 ms 896 KB
15.txt AC 1 ms 128 KB
16.txt AC 1 ms 128 KB
s1.txt AC 1 ms 128 KB
s2.txt AC 1 ms 128 KB