QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #686159 | #8340. 3 Sum | MaxDYF | RE | 184ms | 67268kb | Python3 | 395b | 2024-10-29 02:18:20 | 2024-10-29 02:18:21 |
Judging History
answer
n, k = map(int, input().split())
mod = (10**k) - 1
a = []
s = dict()
for i in range(n):
a.append(int(input()) % mod)
for i in range(n):
for j in range(i, n):
x = a[i]
y = a[j]
s[(x + y) % mod] = s.get((x + y) % mod, 0) + 1
ans = 0
for x in a:
ans += s.get(mod - x, 0)
for x in a:
if ((x + x + x) % mod == 0):
ans -= 1
print(ans)
詳細信息
Test #1:
score: 100
Accepted
time: 9ms
memory: 10524kb
input:
4 1 0 1 10 17
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 184ms
memory: 67268kb
input:
500 859 7118711592236878297922359501613604144948355616986970837340677671376753603836852811886591300370143151943368529129749813118476151865844255212534355441611481420938483178075143062691345257288242460282715389758789648541099090735875617822348551942134616963557723055980260082230902505269975518146286...
output:
0
result:
ok 1 number(s): "0"
Test #3:
score: -100
Dangerous Syscalls
input:
500 17336 11871159223687829792235950161360414494835561698697083734067767137675360383685281188659130037014315194336852912974981311847615186584425521253435544161148142093848317807514306269134525728824246028271538975878964854109909073587561782234855194213461696355772305598026008223090250526997551814628...