# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638309 | iee | Spiderman (COCI20_spiderman) | C++17 | 92 ms | 10868 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.
// iee
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <set>
#include <map>
#define rep(i, a, b) for (auto i = (a); i <= (b); ++i)
#define per(i, a, b) for (auto i = (a); i >= (b); --i)
#define fi first
#define se second
using ll = long long;
using ull = unsigned long long;
using namespace std;
void work(int);
template <class T> void read(T &x) {
x = 0; int f = 1, ch = getchar();
while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + (ch - '0'), ch = getchar();
x *= f;
}
int main() {
int TT = 1; // cin >> TT;
rep(CAS, 1, TT)
work(CAS);
return 0;
}
const int N = 3e5 + 5, M = 1e6 + 5;
int n, k, a[N];
int cnt[M], ans[M];
void work(int CASE) {
scanf("%d%d", &n, &k);
rep(i, 1, n) scanf("%d", &a[i]), cnt[a[i]]++;
rep(i, k + 1, M - 1)
for (int j = k; j < M; j += i)
ans[j] += cnt[i];
rep(i, 1, n) printf("%d ", ans[a[i]] - (k == 0));
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |