Submission #1818905


Source Code Expand

Copy
#include<stdio.h>
#include<math.h>

int main(){
    int count,longsq,a;
    longsq=0;
    scanf("%d",&count);
    int x[count],y[count];
    for(int i=0;i<count;i++){
        scanf("%d %d",&(x[i]),&(y[i]));
    }
    for(int j=0;j<count-1;j++){
        for(int k=j+1;k<count;k++){
            a=(x[j]-x[k])*(x[j]-x[k])+(y[j]-y[k])*(y[j]-y[k]);
            //printf("%d %d %d\n",j,k,a);
            if(a>longsq){longsq=a;}
        }
    }
    printf("%f\n",sqrtf(longsq));
    return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User c05ngzk
Language C (Clang 3.8.0)
Score 100
Code Size 509 Byte
Status
Exec Time 1 ms
Memory 128 KB

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 1 ms 128 KB
00_sample_01.txt 1 ms 128 KB
00_sample_02.txt 1 ms 128 KB
00_sample_03.txt 1 ms 128 KB
00_sample_04.txt 1 ms 128 KB
00_sample_05.txt 1 ms 128 KB
01_rnd_00.txt 1 ms 128 KB
01_rnd_01.txt 1 ms 128 KB
01_rnd_02.txt 1 ms 128 KB
01_rnd_03.txt 1 ms 128 KB
01_rnd_04.txt 1 ms 128 KB
01_rnd_05.txt 1 ms 128 KB
01_rnd_06.txt 1 ms 128 KB
01_rnd_07.txt 1 ms 128 KB
01_rnd_08.txt 1 ms 128 KB
01_rnd_09.txt 1 ms 128 KB
01_rnd_10.txt 1 ms 128 KB
01_rnd_11.txt 1 ms 128 KB
01_rnd_12.txt 1 ms 128 KB
01_rnd_13.txt 1 ms 128 KB
01_rnd_14.txt 1 ms 128 KB
01_rnd_15.txt 1 ms 128 KB
01_rnd_16.txt 1 ms 128 KB
01_rnd_17.txt 1 ms 128 KB
01_rnd_18.txt 1 ms 128 KB
01_rnd_19.txt 1 ms 128 KB