Submission #603172

---

Source Code Expand

def euclid_dis(x1,y1,x2,y2): return ((x1-x2)**2+(y1-y2)**2)**0.5
def choco(xa,ya,xb,yb,xc,yc,xd,yd): return 1 if abs((yb-ya)*(yd-yc)+(xb-xa)*(xd-xc))<1.e-10 else 0

n=int(raw_input())
l=[]
for i in range(n):
    x,y=map(int,raw_input().split())
    l.append((x,y))
ans=chk=0
for i in range(n-1):
    for j in range(i+1,n):
        ans=max(ans,euclid_dis(l[i][0],l[i][1],l[j][0],l[j][1]))
print ans

Submission Info

Judge Result