#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e6 + 2;
ll cnt[N] = {0}, T[N] = {0};
ll a[N] = {0};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m, r, x, y, i, j, ans, t;
cin >> n >> m;
for (i = 1; i <= n; i ++) {
cin >> a[i];
cnt[a[i]] ++;
}
for (i =m + 1; i <= 1e6; i ++) {
for (j = 0; j <= 1e6; j += i) {
T[j] += cnt[i];
}
}
for (i = 1; i<= n; i ++ ) {
r = a[i] - m;
cout << T[r] << " ";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |