Submission #19556187


Source Code Expand

Copy
import math
def conbination(n, r):
    return math.factorial(n) // (math.factorial(n - r)*math.factorial(r))

n = int(input())  # nは入力回数
num_list=[0]*n
ascii_num_seki=1
for i in range(n):
    s = input()
    for k in range(10):
        ascii_num_seki*=(ord(s[k])-96)
    num_list[i]=ascii_num_seki
    ascii_num_seki=1

check_key={}
for i in range(n):
    if num_list[i] not in check_key:
        check_key[num_list[i]]=1
    else:
        check_key[num_list[i]]+=1

count=0
for v in check_key.values():
    if v>1:
        count+=conbination(v,2)
print(count)

Submission Info

Submission Time
Task C - Green Bin
User oki_516
Language Python (3.8.2)
Score 0
Code Size 595 Byte
Status WA
Exec Time 626 ms
Memory 17784 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 6
WA × 7
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13
Case Name Status Exec Time Memory
a01 AC 27 ms 8952 KB
a02 AC 21 ms 8860 KB
a03 AC 19 ms 8928 KB
b04 AC 21 ms 9060 KB
b05 WA 351 ms 12680 KB
b06 WA 373 ms 14620 KB
b07 AC 371 ms 14408 KB
b08 WA 372 ms 17568 KB
b09 WA 360 ms 16804 KB
b10 WA 381 ms 17496 KB
b11 AC 626 ms 15444 KB
b12 WA 411 ms 17784 KB
b13 WA 27 ms 8904 KB