QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #683488 | #8340. 3 Sum | ucup-team3519# | Compile Error | / | / | C++17 | 447b | 2024-10-27 21:25:45 | 2024-10-27 21:25:48 |
Judging History
answer
mod = 444445555566666677
n, k = map(int, input().split())
a = []
# print(a)
M = 10**k - 1
for i in range(0, n) :
tmp = int(input())
tmp %= M
tmp %= mod
a.append(tmp)
ans = 0
for i in range(n) :
for j in range(i, n) :
for k in range(j, n) :
tmp = (a[i] + a[j] + a[k]) % mod
ans += tmp == 0 or tmp == M or tmp == (M * 2) % mod or tmp == (M * 3) % mod
print(ans)
Details
answer.code:7:3: error: invalid preprocessing directive #print
7 | # print(a)
| ^~~~~
answer.code:1:1: error: ‘mod’ does not name a type
1 | mod = 444445555566666677
| ^~~