# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916569 | Wansur | Parrots (IOI11_parrots) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#define f first
#define s second
#define ent '\n';
using namespace std;
typedef long long ll;
const int mx=2e5+12;
void output(int b);
void send(int a);
void decode(int m, int n, int a[]){
for(int i=0;i<m;i++){
output(0);
}
}
void encode(int n, int a[]){
for(int i=0;i<n;i++){
a[i]=0;
}
}