Submission #6636920

Source Code Expand

import math

N, D = map(int, input().split())
X = []
for i in range(N):
    X.append(list(map(int, input().split())))

def dist(a, b):
    d = 0.0
    for i in range(len(a)):
        d += (a[i] - b[i]) ** 2
    return d ** .5

ans = 0
for i in range(N):
    for j in range(i + 1, N):
        a, b = X[i], X[j]
        d = dist(a, b)
        if int(d) == d:
            ans += 1
print(ans)

Submission Info

Submission Time
Task B - Good Distance
User d2verb
Language Python (3.4.3)
Score 200
Code Size 410 Byte
Status AC
Exec Time 18 ms
Memory 3064 KiB

Judge Result

Set Name All Sample
Score / Max Score 200 / 200 0 / 0
Status
AC × 13
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 17 ms 3064 KiB
sample_02 AC 17 ms 3064 KiB
sample_03 AC 17 ms 3060 KiB
testcase_01 AC 17 ms 3060 KiB
testcase_02 AC 18 ms 3064 KiB
testcase_03 AC 17 ms 3064 KiB
testcase_04 AC 18 ms 3064 KiB
testcase_05 AC 17 ms 3060 KiB
testcase_06 AC 17 ms 3060 KiB
testcase_07 AC 17 ms 3064 KiB
testcase_08 AC 17 ms 3064 KiB
testcase_09 AC 17 ms 3064 KiB
testcase_10 AC 17 ms 3064 KiB