# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483429 | rainboy | Hop (COCI21_hop) | C11 | 30 ms | 1260 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 1000
int main() {
static int aa[N];
int n, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
long long x;
scanf("%lld", &x);
aa[i] = 0;
while (1LL << aa[i] + 1 <= x)
aa[i]++;
}
for (j = 1; j < n; j++) {
for (i = 0; i < j; i++)
printf("%d ", (aa[i] >> 4) != (aa[j] >> 4) ? 1 : ((aa[i] >> 2) != (aa[j] >> 2) ? 2 : 3));
printf("\n");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |