# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638258 | colazcy | Spiderman (COCI20_spiderman) | C++17 | 79 ms | 10124 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 <cstdio>
#include <cassert>
#include <algorithm>
#define let const auto
#define rep(name,beg,end) for(auto lim_##name = end,name = beg;name <= lim_##name;name++)
#define per(name,beg,end) for(auto lim_##name = end,name = beg;name >= lim_##name;name--)
#define repn(lim) for(auto REPN_lIM = lim,REPN = 1;REPN <= REPN_lIM;REPN++)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define trace() debug("line : %d, Function : %s\n",__LINE__,__FUNCTION__)
using ll = long long;
constexpr int maxn = 3e5 + 100,maxm = 1e6 + 100;
int n,k,val[maxn];
int f[maxm],ans[maxm];
int main(){
#ifndef ONLINE_JUDGE
// std::freopen("fufu.in","r",stdin);
// std::freopen("fufu.out","w",stdout);
#endif
std::scanf("%d %d",&n,&k);
rep(i,1,n)
std::scanf("%d",val + i),
f[val[i]]++;
rep(i,k + 1,maxm - 1)
if(f[i])
for(int r = k;r < maxm;r += i)
ans[r] += f[i];
rep(i,1,n)
if(val[i] < k)std::printf("%d ",0);
else std::printf("%d ",ans[val[i]] - (k == 0));
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |