Submission #1573217


Source Code Expand

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

typedef struct
{
	int x;
	int y;
}Point;

int main()
{
	int n, i, j;
	Point *p;
	double max = 0;

	scanf("%d", &n);

	p = (Point *)calloc(n, sizeof(Point));

	for(i = 0; i < n; i++)
		scanf("%d%d", &p[i].x, &p[i].y);

	for(i = 0; i < n - 1; i++)
		for(j = i + 1; j < n; j++)
			max = (max < sqrt(pow(p[i].x - p[j].x, 2) + pow(p[i].y - p[j].y, 2))) ? sqrt(pow(p[i].x - p[j].x, 2) + pow(p[i].y - p[j].y, 2)): max;

	printf("%.6f\n", max);
	
	free(p);

	return 0;
}

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User mafun
Language C++14 (GCC 5.4.1)
Score 100
Code Size 549 Byte
Status
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:22:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &p[i].x, &p[i].y);
                                  ^

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