AtCoder Regular Contest 004

Submission #1661632

Source codeソースコード

#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

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

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

./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]);
^

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 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