#include "koala.h"
int minValue(int N, int W) {
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
int b[110], r[110];
for (int i = 0; i < N; ++i) {
b[i] = 0;
}
b[0] = 1;
playRound(b, r);
int x = -1;
for (int i = 0; i < N; ++i) {
if (r[i] == 0) {
x = i;
}
}
if (x != -1) return x;
b[0] = 0;
b[1] = 1;
playRound(b, r);
for (int i = 0; i < N; ++i) {
if (r[i] == 0) {
x = i;
}
}
return x;
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
int greaterValue(int N, int W) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
return 0;
}
void allValues(int N, int W, int *P) {
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
