# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017201 | vjudge1 | Spiderman (COCI20_spiderman) | C++17 | 127 ms | 27996 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;
#define int long long
int const N=2e6+5;
int const mod=1e9+7;
bool upd[N];
int cnt[N];
int ans[N];
signed main(){
int n,k;
cin>>n>>k;
int arr[n];
for (int i = 0; i < n; ++i){
cin>>arr[i];
cnt[arr[i]]++;
}
for (int i = 0; i < n; ++i)
{
if(upd[arr[i]]>0 || arr[i]<=k)
continue;
upd[arr[i]]=1;
for(int j=k;j<N;j+=arr[i]){
if(arr[i]==j)
ans[j]--;
ans[j]+=cnt[arr[i]];
}
}
for(int i=0;i<n;i++)
cout<<ans[arr[i]]<<' ';
cout<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |