# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481402 | rainboy | Spiderman (COCI20_spiderman) | C11 | 89 ms | 10176 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 <stdio.h>
#define N 300000
#define A 1000000
int main() {
static int aa[N], kk[A + 1], ans[A + 1];
int n, r, i, a, b;
scanf("%d%d", &n, &r);
for (i = 0; i < n; i++) {
scanf("%d", &aa[i]);
kk[aa[i]]++;
}
for (a = r + 1; a <= A; a++)
for (b = r; b <= A; b += a)
ans[b] += kk[a];
for (i = 0; i < n; i++)
printf("%d ", ans[aa[i]] - (r == 0 ? 1 : 0));
printf("\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |