#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
int d[maxn], res[maxn];
int minValue(int N, int W) {
d[0] = 1;
playRound(d, res);
if (res[0] == 0)
return 0;
for (int i = 1; i < N; i++)
if (res[i] == 0)
return i;
return 0;
}
int maxValue(int N, int W) {
for (int i = 0; i < N; i++)
d[i] = 1;
playRound(d, res);
memset(d, 0, sizeof(d));
for (int i = 0; i < N; i++)
if (res[i] == 2)
d[i] = 2;
playRound(d, res);
memset(d, 0, sizeof(d));
for (int i = 0; i < N; i++)
if (res[i] == 3)
d[i] = 4;
playRound(d, res);
memset(d, 0, sizeof(d));
for (int i = 0; i < N; i++)
if (res[i] == 5)
d[i] = 11;
playRound(d, res);
for (int i = 0; i < N; i++)
if (res[i] == 12)
return i;
return 0;
}
void clear()
{
memset(d, 0, sizeof(d));
}
int greaterValue(int N, int W)
{
d[0] = d[1] = 2;
playRound(d, res);
if (res[0] > res[1]) return 0;
if (res[0] < res[1]) return 1;
if (res[0] > 2) {
d[0] = d[1] = 4;
playRound(d, res);
if (res[0] > res[1]) return 0;
if (res[0] < res[1]) return 1;
if (res[0] > 4)
d[0] = d[1] = 8;
else
d[0] = d[1] = 3;
playRound(d, res);
if (res[0] > res[1]) return 0;
if (res[0] < res[1]) return 1;
}
else {
d[0] = d[1] = 3;
playRound(d, res);
if (res[0] > res[1]) return 0;
if (res[0] < res[1]) return 1;
if (res[0] > 3)
d[0] = d[1] = 5;
else d[0] = d[1] = 1;
playRound(d, res);
if (res[0] > res[1]) return 0;
if (res[0] < res[1]) return 1;
}
return 3;
}
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.
}
}
