# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64160 | zubec | 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 "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int ans[100];
void decode(int N, int L, int X[]){
for (int i = 0; i < N; i++)
ans[i] = 0;
for (int i = 0; i < L; i++){
ans[X[i]&((1<<5)-1)] |= (1<<(X[i]>>5));
}
for (int i = 0; i < N; i++)
output(ans[i]);
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int ans[100];
void decode(int N, int L, int X[]){
for (int i = 0; i < L; i++){
ans[X[i]&((1<<5)-1)] |= (1<<(X[i]>>5));
}
for (int i = 0; i < N; i++)
output(ans[i]);
}