#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)
for (int j=0; j*i+k<=mxV; ++j)
ans[j*i+k]+=cnt[i];
if (k==0) for (int i=1; i<=mxV; ++i) --ans[i];
for (int i=0; i<n; ++i)
cout << ans[a[i]] << (i<n-1?" ":"\n");
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
27 ms |
6656 KB |
Output is correct |
2 |
Correct |
24 ms |
5880 KB |
Output is correct |
3 |
Correct |
50 ms |
7288 KB |
Output is correct |
4 |
Correct |
84 ms |
8824 KB |
Output is correct |
5 |
Correct |
54 ms |
8824 KB |
Output is correct |
6 |
Correct |
97 ms |
10232 KB |
Output is correct |
7 |
Correct |
49 ms |
8824 KB |
Output is correct |
8 |
Correct |
57 ms |
8824 KB |
Output is correct |
9 |
Correct |
100 ms |
10156 KB |
Output is correct |
10 |
Correct |
93 ms |
10104 KB |
Output is correct |