Submission #3383863


Source Code Expand

Copy
var
 i,j,n:longint;
 x,y:array[0..101] of longint;
 m:real;
begin
 readln(n);
 for i:=1 to n do
  readln(x[i],y[i]);
  for i:=1 to n-1 do
   for j:=i+1 to n do
    if sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))>m then m:=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
 writeln(m:0:6);
end.

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User luogu_bot2
Language Pascal (FPC 2.6.2)
Score 100
Code Size 319 Byte
Status
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 Score / Max Score Test Cases
All 100 / 100 00_max.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt
Case Name Status Exec Time Memory
00_max.txt 0 ms 128 KB
00_sample_01.txt 0 ms 128 KB
00_sample_02.txt 0 ms 128 KB
00_sample_03.txt 0 ms 128 KB
00_sample_04.txt 0 ms 128 KB
00_sample_05.txt 0 ms 128 KB
01_rnd_00.txt 0 ms 128 KB
01_rnd_01.txt 0 ms 128 KB
01_rnd_02.txt 0 ms 128 KB
01_rnd_03.txt 0 ms 128 KB
01_rnd_04.txt 0 ms 128 KB
01_rnd_05.txt 0 ms 128 KB
01_rnd_06.txt 0 ms 128 KB
01_rnd_07.txt 0 ms 128 KB
01_rnd_08.txt 0 ms 128 KB
01_rnd_09.txt 0 ms 128 KB
01_rnd_10.txt 0 ms 128 KB
01_rnd_11.txt 0 ms 128 KB
01_rnd_12.txt 0 ms 128 KB
01_rnd_13.txt 0 ms 128 KB
01_rnd_14.txt 0 ms 128 KB
01_rnd_15.txt 0 ms 128 KB
01_rnd_16.txt 0 ms 128 KB
01_rnd_17.txt 0 ms 128 KB
01_rnd_18.txt 0 ms 128 KB
01_rnd_19.txt 0 ms 128 KB