AtCoder Regular Contest 004

Submission #2282075

Source codeソースコード

var
    i,j,n:longint;
    x,y:array[1..100]of longint;
    ans: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]))>ans then ans:=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
    writeln(ans:0:6);
end.

Submission

Task問題 A - 2点間距離の最大値 ( The longest distance )
User nameユーザ名 luogu_bot5
Created time投稿日時
Language言語 Pascal (FPC 2.6.2)
Status状態 AC
Score得点 100
Source lengthソースコード長 365 Byte
File nameファイル名
Exec time実行時間 0 ms
Memory usageメモリ使用量 128 KB

Compiler messageコンパイルメッセージ

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

Test case

Set

Set name Score得点 / Max score 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_max.txt AC
00_sample_01.txt AC
00_sample_02.txt AC
00_sample_03.txt AC
00_sample_04.txt AC
00_sample_05.txt AC
01_rnd_00.txt AC
01_rnd_01.txt AC
01_rnd_02.txt AC
01_rnd_03.txt AC
01_rnd_04.txt AC
01_rnd_05.txt AC
01_rnd_06.txt AC
01_rnd_07.txt AC
01_rnd_08.txt AC
01_rnd_09.txt AC
01_rnd_10.txt AC
01_rnd_11.txt AC
01_rnd_12.txt AC
01_rnd_13.txt AC
01_rnd_14.txt AC
01_rnd_15.txt AC
01_rnd_16.txt AC
01_rnd_17.txt AC
01_rnd_18.txt AC
01_rnd_19.txt AC