Submission #7967814

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main()
{
	long long N, K;
	cin >> N >> K;
	vector<long long> A;
	int acnt = 0;
	for( int i = 0; i < N; i++ ) {
		long long a;
		cin >> a;
		if( a % K == 0 ) acnt++;
		else if( __gcd( a, K ) != 1 ) A.push_back( a );
	}

	long long ans = 0;
	for( int i = 0, nn = N - 1; i < acnt; i++, nn-- ) {
		ans += nn;
	}
	int n = A.size();
	for( int i = 0; i < n - 1; i++ ) {
		for( int j = i + 1; j < n; j++ ) {
			if( A[i] * A[j] % K ) continue;
			ans++;
		}
	}

	cout << ans << endl;
}

Submission Info

Judge Result