#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 42, INF = 1e18 + 42;
int n, k, maxi = 0, h[N], val[N], occ[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for(int i = 0; i < n; i++) {
cin >> h[i];
maxi = max(maxi, h[i]);
occ[h[i]]++;
}
for(int i = k+1; i <= maxi; i++)
for(int j = k; j <= maxi; j += i)
val[j] += occ[i];
if(k == 0)
for(int i = 0; i <= maxi; i++)
val[i]--;
for(int i = 0; i < n; i++)
cout << val[h[i]] << ' ';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
11092 KB |
Output is correct |
2 |
Correct |
44 ms |
9904 KB |
Output is correct |
3 |
Correct |
57 ms |
12332 KB |
Output is correct |
4 |
Correct |
98 ms |
14476 KB |
Output is correct |
5 |
Correct |
83 ms |
17000 KB |
Output is correct |
6 |
Correct |
101 ms |
19200 KB |
Output is correct |
7 |
Correct |
74 ms |
16884 KB |
Output is correct |
8 |
Correct |
67 ms |
16888 KB |
Output is correct |
9 |
Correct |
130 ms |
19064 KB |
Output is correct |
10 |
Correct |
113 ms |
19016 KB |
Output is correct |