# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
360312 | sean617 | Parrots (IOI11_parrots) | C++98 | 1 ms | 1344 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 "encoder.h"
#include "encoderlib.h"
void encode(int N, int M[])
{
int i, re = 0;
for(i=0; i<N; i++) {
re = re * 2 + M[i];
}
send(re);
}
#include "decoder.h"
#include "decoderlib.h"
#include<cstring>
int ans[1000];
void decode(int N, int L, int X[])
{
int i = 0, a, b;
memset(ans, 0, sizeof(ans));
a = X[0];
while (a > 0) {
ans[i++] = a % 2;
a/=2;
}
for (i = N - 1; i >= 0; i--) output(ans[i]);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |