#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int B[105],R[105];
int minValue(int N, int W) {
for(int i=0;i<N;i++) B[i]=0;
B[0]=1;
playRound(B,R);
for(int i=0;i<N;i++) if(R[i]<=B[i]) return i;
return 0;
}
int maxValue(int N, int W) {
vector<int> ord(N);
iota(ord.begin(),ord.end(),0);
while((int)ord.size()>1){
for(int i=0;i<N;i++) B[i]=0;
for(int x:ord) B[x]=N/(int)ord.size();
vector<int> nxt;
playRound(B,R);
for(int x:ord) if(R[x]>B[x]) nxt.push_back(x);
swap(nxt,ord);
}
return ord[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.
}
}
