QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#752399	#858. GCD vs. XOR	kangkunma	TL	65ms	26348kb	Python3	322b	2024-11-16 01:56:04	2024-11-16 01:56:04

Judging History

你现在查看的是最新测评结果

[2024-11-16 01:56:04]
评测

测评结果：TL
用时：65ms
内存：26348kb

查看

[2024-11-16 01:56:04]
提交

answer

def s(l):
    C=[0]*2000001;A=0
    for i in l:C[i]+=1
    for i in set(l):
        for j in range(1,min(2000000-i,int(i**.5))+1):
            if i%j<1:A+=C[i]*C[j+i]*(i^(i+j)==j)+C[i]*C[i//j+i]*(i^(i+i//j)==i//j)*(j**2!=i)
    return A
for i in range(int(input())):input();l=[*map(int,input().split())];print(s(l))

Source code, Language: Python3

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 6ms

memory: 26052kb

input:

1
4
2 3 4 3

output:

result:

ok 1 number(s): "2"

Test #2:

score: 0

Accepted

time: 65ms

memory: 26348kb

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:

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...