Submission #2696320

---

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=gcd(a,k);
		ans+=M[g];
		for(int j=1;j<=g;j++)if(g%j<1)M[k/g*j]++;
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result