#include <bits/stdc++.h>
#include "koala.h"
using namespace std;
int minValue(int n, int w) {
int B[102]={0}, R[102]={0};
for(int i=0; i<n; i++) B[i] = 1;
playRound(B, R);
int done = 0;
for(int i=0; i<n; i++){
if(R[i] == 0) B[i] = 0;
else{
if(!done) B[i] = 1, done = 1;
else B[i] = 0;
}
}
playRound(B, R);
for(int i=0; i<n; i++){
if(!B[i] && !R[i]) return i;
}
return 0;
}
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.
}
}
