#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=3e5, mxV=1e6;
int n, k, a[mxN], cnt[mxV+1];
int ans[mxV+1];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i=0; i<n; ++i) cin >> a[i], ++cnt[a[i]];
for (int i=k+1; i<=mxV; ++i) if (cnt[i]>0) {
for (int j=0; j*i+k<=mxV; ++j) ans[j*i+k]+=cnt[i];
}
for (int i=0; i<n; ++i) cout << ans[a[i]] << " ";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
6656 KB |
Output is correct |
2 |
Correct |
11 ms |
5760 KB |
Output is correct |
3 |
Correct |
32 ms |
7928 KB |
Output is correct |
4 |
Correct |
74 ms |
10484 KB |
Output is correct |
5 |
Incorrect |
52 ms |
9464 KB |
Output isn't correct |
6 |
Incorrect |
102 ms |
12152 KB |
Output isn't correct |
7 |
Correct |
53 ms |
9464 KB |
Output is correct |
8 |
Correct |
48 ms |
9464 KB |
Output is correct |
9 |
Correct |
104 ms |
12024 KB |
Output is correct |
10 |
Correct |
96 ms |
12024 KB |
Output is correct |