Submission #2713066


Source Code Expand

import math

N = input() 

list = []

for i in range(N):
	list.append(map(int, raw_input().split()))
	
ans = 0
	
for i in range(N-1):
	for j in range(i+1,N):
		dist_x = list[j][0] - list[i][0]
		dist_y = list[j][1] - list[i][1]
		dist = math.sqrt(dist_x**2 + dist_y**2)
		ans = max(ans, dist)
		
print ans

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User simamumu
Language Python (2.7.6)
Score 100
Code Size 323 Byte
Status AC
Exec Time 15 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 10 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 14 ms 2692 KB
01_rnd_01.txt AC 14 ms 2692 KB
01_rnd_02.txt AC 14 ms 2692 KB
01_rnd_03.txt AC 14 ms 2692 KB
01_rnd_04.txt AC 14 ms 2692 KB
01_rnd_05.txt AC 14 ms 2692 KB
01_rnd_06.txt AC 14 ms 2692 KB
01_rnd_07.txt AC 14 ms 2692 KB
01_rnd_08.txt AC 14 ms 2692 KB
01_rnd_09.txt AC 14 ms 2692 KB
01_rnd_10.txt AC 14 ms 2692 KB
01_rnd_11.txt AC 14 ms 2692 KB
01_rnd_12.txt AC 14 ms 2692 KB
01_rnd_13.txt AC 14 ms 2692 KB
01_rnd_14.txt AC 14 ms 2692 KB
01_rnd_15.txt AC 14 ms 2692 KB
01_rnd_16.txt AC 15 ms 2692 KB
01_rnd_17.txt AC 14 ms 2692 KB
01_rnd_18.txt AC 14 ms 2692 KB
01_rnd_19.txt AC 14 ms 2692 KB