Submission #3790209


Source Code Expand

import math
N =input()
Points = [map(int,raw_input().split()) for i in range(N)]
Max=0
Ans=0 
for i in range(N):
	for j in range(i+1,N):
		Ans = math.sqrt(((Points[i][0]-Points[j][0])**2)+(Points[i][1]-Points[j][1])**2)
		if Ans > Max:
			Max = Ans
print Max

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User kakaedashi
Language Python (2.7.6)
Score 100
Code Size 268 Byte
Status AC
Exec Time 13 ms
Memory 2692 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 26
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 11 ms 2692 KB
00_sample_01.txt AC 10 ms 2692 KB
00_sample_02.txt AC 10 ms 2692 KB
00_sample_03.txt AC 10 ms 2692 KB
00_sample_04.txt AC 10 ms 2692 KB
00_sample_05.txt AC 10 ms 2692 KB
01_rnd_00.txt AC 13 ms 2692 KB
01_rnd_01.txt AC 13 ms 2692 KB
01_rnd_02.txt AC 13 ms 2692 KB
01_rnd_03.txt AC 13 ms 2692 KB
01_rnd_04.txt AC 13 ms 2692 KB
01_rnd_05.txt AC 13 ms 2692 KB
01_rnd_06.txt AC 13 ms 2692 KB
01_rnd_07.txt AC 13 ms 2692 KB
01_rnd_08.txt AC 13 ms 2692 KB
01_rnd_09.txt AC 13 ms 2692 KB
01_rnd_10.txt AC 13 ms 2692 KB
01_rnd_11.txt AC 13 ms 2692 KB
01_rnd_12.txt AC 13 ms 2692 KB
01_rnd_13.txt AC 13 ms 2692 KB
01_rnd_14.txt AC 13 ms 2692 KB
01_rnd_15.txt AC 13 ms 2692 KB
01_rnd_16.txt AC 13 ms 2692 KB
01_rnd_17.txt AC 13 ms 2692 KB
01_rnd_18.txt AC 13 ms 2692 KB
01_rnd_19.txt AC 13 ms 2692 KB