# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337576 | seedkin | 올림픽 피자 (tutorial5) | C11 | 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 "pizza.h"
struct Order {
int next;
int needCnt;
int need[8];
};
int order_num;
int material[8];
int allMate;
struct Order order[100000];
int root[256];
int last[256];
int check() {
for(int i =0; i < needCnt; i++) {
if(material[need[i]] == 0) return 0;
}
return 1;
}
int makeMate(int N, int *A) {
int r = 0;
for(int i =0;i < N; i++) {
r |= (1 << A[i]);
}
return r;
}