Submission #1343072


Source Code Expand

const   fi='TAP.inp';
        fo='TAP.out';
var maxx,minx,x,kq,i,n:longint;

procedure nhap;
begin
        read(n);
        maxx:=0;
        minx:=maxlongint;
        for i:=1 to n do
        begin
                read(x);
                if x>maxx then maxx:=x;
                if x<minx then minx:=x;
        end;
end;


procedure xuly;
begin
        kq:=maxx-minx;
        write(kq);
end;

begin

        nhap;
        xuly;
end.

Submission Info

Submission Time
Task B - Traveling AtCoDeer Problem
User happyness
Language Pascal (FPC 2.6.2)
Score 200
Code Size 460 Byte
Status AC
Exec Time 0 ms
Memory 128 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 200 / 200
Status
AC × 2
AC × 6
Set Name Test Cases
Sample s1.txt, s2.txt
All in1.txt, in2.txt, in3.txt, in4.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
in1.txt AC 0 ms 128 KB
in2.txt AC 0 ms 128 KB
in3.txt AC 0 ms 128 KB
in4.txt AC 0 ms 128 KB
s1.txt AC 0 ms 128 KB
s2.txt AC 0 ms 128 KB