Submission #6748679

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {
    int n, k;
    long long ans = 0;
    vector<int> v, w;
    cin >> n >> k;
    for(int i=1;i*i<=k;i++){
        if(k%i == 0){
            v.push_back(i);
            if(i*i < k){
                v.push_back(k/i);
            }
        }
    }
    sort(v.begin(), v.end(), greater<int>());
    w.assign(v.size(), 0);
    for(int i=0;i<n;i++){
        long long a;
        cin >> a;
        for(int j=0;j<v.size();j++){
            if((a*v[j])%k == 0){
                ans += w[j];
            }
        }
        for(int j=0;j<v.size();j++){
            if(a%v[j] == 0){
                w[j]++;
                break;
            }
        }
        
    }
    cout << ans << endl;
    /*for(int j=0;j<v.size();j++){
        cout<<v[j]<<w[j]<<endl;
    }*/
	return 0;
}

Submission Info

Judge Result