提出 #7124005

---

ソースコード 拡げる

def distance(a, b):
    d = len(a)
    s = 0
    for i in range(d):
        s += (a[i] - b[i]) ** 2
    return s ** 0.5


n, _ = map(int, input().split())
xs = [list(map(int, input().split()))
      for _ in range(n)]

cnt = 0
for i in range(n):
    for j in range(i + 1, n):
        d = distance(xs[i], xs[j])
        if (d - int(d)) == 0:
            cnt += 1
print(cnt)

提出情報

ジャッジ結果