QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #752414 | #858. GCD vs. XOR | kangkunma | TL | 2586ms | 201068kb | Python3 | 435b | 2024-11-16 02:22:45 | 2024-11-16 02:22:46 |
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:A+=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: 2586ms
memory: 201044kb
input:
1 4 2 3 4 3
output:
2
result:
ok 1 number(s): "2"
Test #2:
score: 0
Accepted
time: 2464ms
memory: 201068kb
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:
9 54 13 7 8 34 47 11 1 102 6 5 37 1 3 8 8 348 15 0
result:
ok 20 numbers
Test #3:
score: -100
Time Limit Exceeded
input:
20 1318434 383714 853663 66866 511925 858736 184314 296349 849141 468962 414270 917939 220934 778184 984811 194692 105206 528188 310859 57152 790101 274637 529663 931099 79533 179471 539390 210762 400829 514992 127623 369248 168711 380204 767781 753089 645551 714964 101060 340524 937457 928656 65201...
output:
3032046 3638995 2800796 2440602 4854508 3744477 2051988 2014444 1784404