#include <bits/stdc++.h>
#define PB push_back
#define ST first
#define ND second
#define _ ios_base::sync_with_stdio(0); cin.tie(0);
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
const int nax = 1e6 + 10;
int n, k, mx;
vi num;
int ans[nax], cnt[nax];
int main() {_
cin >> n >> k;
num.resize(n);
for(int i = 0; i < n; ++i) {
cin >> num[i];
cnt[num[i]]++;
mx = max(mx, num[i]);
}
for(int i = 1; i <= mx; ++i) {
if(cnt[i] == 0 || i <= k) continue;
for(int j = 0; j <= mx; j += i) {
if(j + k <= mx) {
ans[j + k] += cnt[i];
}
}
if(k == 0) ans[i]--;
}
for(int x : num) {
cout << ans[x] << " ";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
6476 KB |
Output is correct |
2 |
Correct |
9 ms |
5580 KB |
Output is correct |
3 |
Correct |
32 ms |
7192 KB |
Output is correct |
4 |
Correct |
72 ms |
8716 KB |
Output is correct |
5 |
Correct |
48 ms |
8772 KB |
Output is correct |
6 |
Correct |
98 ms |
10268 KB |
Output is correct |
7 |
Correct |
39 ms |
8720 KB |
Output is correct |
8 |
Correct |
50 ms |
8724 KB |
Output is correct |
9 |
Correct |
100 ms |
10052 KB |
Output is correct |
10 |
Correct |
97 ms |
9940 KB |
Output is correct |