QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#752417#858. GCD vs. XORkangkunmaWA 2345ms114536kbPython3492b2024-11-16 02:27:252024-11-16 02:27:26

Judging History

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

  • [2024-11-16 02:27:26]
  • 评测
  • 测评结果:WA
  • 用时:2345ms
  • 内存:114536kb
  • [2024-11-16 02:27:25]
  • 提交

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]*((i+1+j)==j|(1+i))
print('done')
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]:
            if i+j>1000000:break
            A+=C[i]*C[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: 0
Wrong Answer
time: 2345ms
memory: 114536kb

input:

1
4
2 3 4 3

output:

done
2

result:

wrong output format Expected integer, but "done" found