Submission #2713053


Source Code Expand

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)
		print i, j, dist
		ans = max(ans, dist)
		
print ans

Submission Info

Submission Time
Task A - 2点間距離の最大値 ( The longest distance )
User simamumu
Language Python (2.7.6)
Score 0
Code Size 328 Byte
Status RE
Exec Time 11 ms
Memory 2568 KB

Judge Result

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