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 <bits/stdc++.h>
using namespace std;
void send(int a);
void encode(int N, int M[])
{
int i;
for (i = 0; i < N; i++)
send(M[i] + i * 256);
}
#include <bits/stdc++.h>
using namespace std;
void output(int b);
void decode(int N, int L, int X[])
{
sort(X, X + L);
int i;
for (i = 0; i < L; i++)
output(X[i] % 256);
}
# | 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... |