# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483282 | rainboy | Popcount (COCI19_popcount) | C++17 | 3 ms | 276 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>
#include <string.h>
#define L 256
void mult2(int *aa) {
int h;
for (h = 0; h < L; h++)
if ((aa[h] *= 2) >= 10)
aa[h] -= 10, aa[h + 1]++;
}
void add1(int *aa) {
int h;
aa[0] += 1;
for (h = 0; h < L; h++)
if (aa[h] >= 10)
aa[h] -= 10, aa[h + 1]++;
}
int main() {
static int aa[L];
static char cc[L + 1];
int n, m, l, i, cnt;
scanf("%d%*d", &n);
cnt = 0;
for (m = 1; m < n; m <<= 1)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |