# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844283 | vjudge1 | Spiderman (COCI20_spiderman) | C++17 | 54 ms | 11532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+37;
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k; cin >> n >> k;
vector<int> x(n);
vector<int> a(N);
int f=0;
for(int i=0; i<n; i++){
cin >> x[i];
if(x[i]>k) f++;
a[x[i]]++;
}
for(int l=N-1; l>k; l--){
for(int j=l*2; j<N; j+=l){
a[j]+=a[l];
}
}
if(k==0){
for(int i=0; i<n; i++)
cout<<a[x[i]]-1<<" ";
}
else{
for(int i=0; i<n; i++){
if(x[i]-k<=k&&x[i]!=k) cout<<0<<" ";
else if(x[i]==k) cout<<f<<" ";
else cout<<a[x[i]-k]<<" ";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |