Submission #2696326

---

Source Code Expand

#include<iostream>
#include<map>
using namespace std;
int n,k,a;
long ans;
map<long,long>M;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
main()
{
	cin>>n>>k;
	for(int i=0;i<n;i++)
	{
		cin>>a;
		M[gcd(k,a)]++;
	}
	for(auto i:M)
	{
		for(auto j:M)
		{
			if(1LL*i.first*j.first%k<1)ans+=i.first==j.first?i.second*(j.second-1):i.second*j.second;
		}
	}
	cout<<ans/2<<endl;
}

Submission Info

Judge Result