# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344464 | limabeans | Spiderman (COCI20_spiderman) | C++17 | 91 ms | 10220 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;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
int n, k;
int freq[maxn];
int ans[maxn];
vector<int> a;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>k;
a.resize(n);
for (int i=0; i<n; i++) {
cin>>a[i];
freq[a[i]]++;
}
// hi->hj if hi%hj=k
/// hi = hj*x + k, hj>k
for (int hj=k+1; hj<maxn; hj++) {
for (int x=0; hj*x+k<maxn; x++) {
int hi = hj*x+k;
ans[hi] += freq[hj];
}
}
for (int x: a) {
int cur = ans[x];
if (k == 0) cur--;
cout<<cur<<" ";
}
cout<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |