Submission #6968073

---

Source Code Expand

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

import numpy as np
from collections import Counter
from fractions import gcd

N,K = map(int,input().split())
A = [int(x) for x in input().split()]

counter = Counter(gcd(K,x) for x in A)

div = np.array(tuple(counter.keys()))
cnt = np.array(tuple(counter.values()))

div,cnt

answer = 0
for d,k in zip(div,cnt):
    target = (d * div % K == 0) & (div > d)
    answer += cnt[target].sum() * k
    if d*d%K == 0:
        answer += k*(k-1)//2

print(answer)

Submission Info

Judge Result