#include "koala.h"
#include <iostream>
using namespace std;
int minValue(int N, int W) {
int B[N],R[N];
fill(B,B+N,0);
B[0]=1;
playRound(B,R);
int res=0;
for(int i=0;i<N;i++)
if(R[i]==0)
res=i;
return res;
}
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.
}
}
