# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
686648 | Farhan_HY | Spiderman (COCI20_spiderman) | C++14 | 127 ms | 21128 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
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e6 + 5;
const int M = 1e3 + 3;
const int inf = 1e18;
const int mod = 1e9 + 7;
int n, a[N], cnt[N], ans[N], k;
main() {
IOS
cin >> n >> k;
for(int i = 1; i <= n; i++) cin >> a[i], cnt[a[i]]++;
for(int i = k + 1; i <= 1e6; i++) {
for(int j = k; j <= 1e6; j += i) {
ans[j] += cnt[i];
if (i == j)
ans[j]--;
}
}
for(int i = 1; i <= n; i++)
cout << ans[a[i]] << ' ';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |