Submission #1017198

#TimeUsernameProblemLanguageResultExecution timeMemory
1017198vjudge1Spiderman (COCI20_spiderman)C++17
56 / 70
98 ms20304 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
int const N=1e6+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])
			ans[j]+=cnt[arr[i]];
	}
	for(int i=0;i<n;i++)
		cout<<ans[arr[i]]<<' ';
	cout<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...