# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638339 | NeroZein | Spiderman (COCI20_spiderman) | C++14 | 85 ms | 10188 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.
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;
int n, k;
int cnt[N],ans[N];
void seive (){
for(int i=k+1;i<N;i++)
for(int j=k;j<N;j+=i)
ans[j] += cnt[i];
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n>>k;
vector<int>a(n);
for(auto&it:a){
cin>>it;
cnt[it]++;
}
seive();
for(int i=0;i<n;i++)
cout<<ans[a[i]]-(k==0)<<' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |