#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(c) (c).begin(), (c).end()
const int N = 1e6 + 6;
int cnt[N],freq[N];
void solve(){
int n,k;
cin >> n >> k;
vector<int> v(n),ans(n);
for(int i = 0; i < n; i++){
cin >> v[i];
if(v[i] > k) freq[v[i]]++;
}
for(int i = 1; i < N; i++){
for(int j = i; j < N; j += i){
cnt[j] += freq[i];
}
}
int fuck = 0;
for(int i = n - 1; i >= 0; i--){
if(v[i] > k){
ans[i] = cnt[v[i] - k];
}
else if(v[i] == k) ans[i] = fuck;
fuck += (v[i] > k);
}
for(int x : ans){
cout << x << ' ';
}
}
signed main(){
#ifndef ONLINE_JUDGE
// freopen("in.txt","r",stdin); freopen("out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
// cin >> t;
while(t--){
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
15964 KB |
Output isn't correct |
2 |
Incorrect |
13 ms |
15964 KB |
Output isn't correct |
3 |
Incorrect |
26 ms |
17940 KB |
Output isn't correct |
4 |
Incorrect |
55 ms |
21656 KB |
Output isn't correct |
5 |
Incorrect |
28 ms |
17692 KB |
Output isn't correct |
6 |
Incorrect |
56 ms |
21568 KB |
Output isn't correct |
7 |
Incorrect |
39 ms |
17668 KB |
Output isn't correct |
8 |
Incorrect |
28 ms |
17748 KB |
Output isn't correct |
9 |
Incorrect |
55 ms |
21492 KB |
Output isn't correct |
10 |
Incorrect |
58 ms |
21328 KB |
Output isn't correct |