Submission #7069226

---

Source Code Expand

def divisor(n): #約数全列挙
    ans = [1,n]
    i = 2
    while i**2 <= n:
        if n%i == 0:
            ans.append(i)
            if i**2 < n:
                ans.append(n//i)
        i += 1
    ans.sort()
    return ans

from fractions import gcd
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = [gcd(t,k) for t in a]
d_list = divisor(k)
q = {}
for i in a:
    if i in q:
        q[i] += 1
    else:
        q[i] = 1
ans = 0
for i in q:
    for j in q:
        if (i*j)%k == 0:
            if i == j:
                ans += (q[i]-1)*q[i]
            else:
                ans += q[i]*q[j]

print(ans//2)

Submission Info

Judge Result