# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546737 | someone | Spiderman (COCI20_spiderman) | C++14 | 130 ms | 19200 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>
#define int long long
using namespace std;
const int N = 1e6 + 42, INF = 1e18 + 42;
int n, k, maxi = 0, h[N], val[N], occ[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for(int i = 0; i < n; i++) {
cin >> h[i];
maxi = max(maxi, h[i]);
occ[h[i]]++;
}
for(int i = k+1; i <= maxi; i++)
for(int j = k; j <= maxi; j += i)
val[j] += occ[i];
if(k == 0)
for(int i = 0; i <= maxi; i++)
val[i]--;
for(int i = 0; i < n; i++)
cout << val[h[i]] << ' ';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |