#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e2+5;
int minValue(int N, int W) {
int qrs[nx], ans[nx];
for (int i=0; i<N; i++) qrs[i]=(i==0);
playRound(qrs, ans);
for (int i=1; i<N; i++) if (ans[i]==0) return i;
return 0;
}
int maxValue(int N, int W) {
int qrs[nx], ans[nx], per, t=4;
vector<int> idx, nidx;
for (int i=0; i<N;i ++) idx.push_back(i);
while (t--)
{
per=W/idx.size();
for (int i=0; i<N; i++) qrs[i]=0;
for (auto x:idx) qrs[x]=per;
playRound(qrs, ans);
for (int i=0; i<N; i++) if (qrs[i]>0&&ans[i]>qrs[i]) nidx.push_back(i);
idx=nidx;
nidx.clear();
}
return idx[0];
}
int greaterValue(int N, int W) {
int qrs[nx], ans[nx];
for (int i=0; i<N; i++) qrs[i]=0;
for (int i=1; i<=20; i++)
{
qrs[0]=qrs[1]=i;
playRound(qrs, ans);
if (ans[0]>qrs[0]&&ans[1]<=qrs[1]) return 0;
if (ans[1]>qrs[1]&&ans[0]<=qrs[0]) return 1;
}
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.
}
}
