#include <bits/stdc++.h>
using namespace std;
const int LIMIT = 1e6 + 5;
vector<int> tot(LIMIT , 0);
vector<int> ans(LIMIT , 0);
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0) , cout.tie(0);
int n , k;
cin >> n >> k;
vector<int> a(n);
int maxi = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
tot[a[i]]++;
maxi = max(maxi , a[i]);
}
for (int i = k + 1; i <= maxi; i++) {
for (int j = k; j < LIMIT; j += i) {
ans[j] += tot[i];
}
if (k == 0) {
ans[i]--;
}
}
for (int i = 0; i < n; i++) {
cout << ans[a[i]] << " ";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
43 ms |
8312 KB |
Output is correct |
2 |
Correct |
50 ms |
8188 KB |
Output is correct |
3 |
Correct |
69 ms |
8952 KB |
Output is correct |
4 |
Correct |
109 ms |
10360 KB |
Output is correct |
5 |
Correct |
84 ms |
8824 KB |
Output is correct |
6 |
Correct |
139 ms |
10336 KB |
Output is correct |
7 |
Correct |
69 ms |
8824 KB |
Output is correct |
8 |
Correct |
77 ms |
8872 KB |
Output is correct |
9 |
Correct |
130 ms |
10076 KB |
Output is correct |
10 |
Correct |
130 ms |
10208 KB |
Output is correct |