Submission #2696317

---

Source Code Expand

#include<iostream>
#include<map>
using namespace std;
map<int,int>M;
int n,k,a;
long ans;
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;
		int g,t;
		g=t=gcd(a,k);
		for(int j=1;j*j<=t;j++)
		{
			if(t%j<1)
			{
				ans+=M[j]+(j*j==t?0:M[t/j]);
			}
		}
		M[k/g]++;
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result