# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
291013 | penguinhacker | Spiderman (COCI20_spiderman) | C++17 | 104 ms | 12152 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 ll long long
#define ar array
const int mxN=3e5, mxV=1e6;
int n, k, a[mxN], cnt[mxV+1];
int ans[mxV+1];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for (int i=0; i<n; ++i) cin >> a[i], ++cnt[a[i]];
for (int i=k+1; i<=mxV; ++i) if (cnt[i]>0) {
for (int j=0; j*i+k<=mxV; ++j) ans[j*i+k]+=cnt[i];
}
for (int i=0; i<n; ++i) cout << ans[a[i]] << " ";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |