Submission #7804961

---

Source Code Expand

#include "bits/stdc++.h"

using namespace std;

void solve()
{
    long n, k;
    cin >> n >> k;
    vector<long> as(n);
    map<long, long> mp;
    for (int i = 0; i < n; i++)
    {
        cin >> as[i];
        as[i] = __gcd(as[i], k);
        long x = as[i];
        mp[1]++;
        if (x > 1)
            mp[x]++;
        for (long f = 2; f * f <= x; f++)
        {
            if (x % f == 0)
            {
                mp[f]++;

                if (f * f != x)
                {
                    mp[as[i] / f]++;
                }
            }
        }
    }
    long ans = 0;
    for (auto x : as)
    {
        long y = k / x;
        //cout << x << ' ' << y << ' ' << mp[y] << endl;
        ans += mp[y] - (x % y == 0);
    }
    cout << ans / 2 << endl;
}

int main()
{
    solve();
    return 0;
}

Submission Info

Judge Result