QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #752413 | #858. GCD vs. XOR | kangkunma | WA | 2465ms | 201148kb | Python3 | 432b | 2024-11-16 02:21:58 | 2024-11-16 02:21:58 |
Judging History
answer
D=[[] for _ in range(1000001)];x=0
for i in range(1000):
for j in range(i+1,1000000//(1+i)):D[(i+1)*j]+=[i+1]
def s(l):
C=[0]*1000001;A=0
for i in l:C[i]+=1
for i in set(l):
for j in D[i]:
A+=C[i]*C[j+i]*((i+j)==j|i)
if i//j+i<=1000000:C[i]*C[i//j+i]*((i+i//j)==(i//j)|i)*(j**2!=i)
return A
for i in range(int(input())):input();l=[*map(int,input().split())];print(s(l))
详细
Test #1:
score: 100
Accepted
time: 2407ms
memory: 201148kb
input:
1 4 2 3 4 3
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: -100
Wrong Answer
time: 2465ms
memory: 201112kb
input:
20 43 128 66 452 384 400 441 232 203 228 33 284 156 128 190 197 292 388 31 179 343 147 206 450 284 180 73 273 130 168 250 405 203 235 340 309 28 267 395 152 191 295 463 344 54 48 7 12 37 49 24 5 18 15 37 26 57 53 59 22 10 2 16 36 52 64 1 56 42 38 46 53 7 2 8 60 38 54 11 19 50 20 61 6 50 27 5 26 3 4 ...
output:
8 45 12 7 7 25 33 9 1 81 4 4 32 1 1 7 5 318 11 0
result:
wrong answer 1st numbers differ - expected: '9', found: '8'