Submission #1661632
Source Code Expand
#include <stdio.h> #include <math.h> double dist(int xy1[], int xy2[]){ return sqrt((xy1[0] - xy2[0]) * (xy1[0] - xy2[0]) + (xy1[1] - xy2[1]) * (xy1[1] - xy2[1])); } int main(){ int N; scanf("%d\n",&N); int xy[N][2]; for(int i=0; i<N; i++){ scanf("%d %d",&xy[i][0],&xy[i][1]); } double max = 0.0; for(int i=0; i<N; i++){ for(int j=i+1; j<N; j++){ if(max < dist(xy[i], xy[j])){ max = dist(xy[i], xy[j]); } } } printf("%lf\n",max); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | cork18 |
Language | C (GCC 5.4.1) |
Score | 100 |
Code Size | 539 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:11:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d\n",&N); ^ ./Main.c:15:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&xy[i][0],&xy[i][1]); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 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 | AC | 1 ms | 128 KB |
00_sample_01.txt | AC | 1 ms | 128 KB |
00_sample_02.txt | AC | 1 ms | 128 KB |
00_sample_03.txt | AC | 1 ms | 128 KB |
00_sample_04.txt | AC | 1 ms | 128 KB |
00_sample_05.txt | AC | 1 ms | 128 KB |
01_rnd_00.txt | AC | 1 ms | 128 KB |
01_rnd_01.txt | AC | 1 ms | 128 KB |
01_rnd_02.txt | AC | 1 ms | 128 KB |
01_rnd_03.txt | AC | 1 ms | 128 KB |
01_rnd_04.txt | AC | 1 ms | 128 KB |
01_rnd_05.txt | AC | 1 ms | 128 KB |
01_rnd_06.txt | AC | 1 ms | 128 KB |
01_rnd_07.txt | AC | 1 ms | 128 KB |
01_rnd_08.txt | AC | 1 ms | 128 KB |
01_rnd_09.txt | AC | 1 ms | 128 KB |
01_rnd_10.txt | AC | 1 ms | 128 KB |
01_rnd_11.txt | AC | 1 ms | 128 KB |
01_rnd_12.txt | AC | 1 ms | 128 KB |
01_rnd_13.txt | AC | 1 ms | 128 KB |
01_rnd_14.txt | AC | 1 ms | 128 KB |
01_rnd_15.txt | AC | 1 ms | 128 KB |
01_rnd_16.txt | AC | 1 ms | 128 KB |
01_rnd_17.txt | AC | 1 ms | 128 KB |
01_rnd_18.txt | AC | 1 ms | 128 KB |
01_rnd_19.txt | AC | 1 ms | 128 KB |