#include "koala.h"
#include <stdio.h>
#include <string.h>
#define N 100
int minValue(int n, int w) {
static int bb[N], rr[N];
int i;
memset(bb, 0, n * sizeof *bb), bb[0] = 1;
playRound(bb, rr);
for (i = 1; i < n; i++)
if (rr[i] == 0)
return i;
return 0;
}
int aa[] = { 2, 4, 11 };
int maxValue(int n, int w) {
static int bb[N], rr[N];
int i, r;
for (i = 0; i < n; i++)
bb[i] = 1;
playRound(bb, rr);
for (r = 0; r < 3; r++) {
for (i = 0; i < n; i++)
if (bb[i] && rr[i])
bb[i] = aa[r];
else
bb[i] = 0;
playRound(bb, rr);
}
for (i = 0; i < n; i++)
if (bb[i] && rr[i])
return i;
return -1;
}
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 *pp) {
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.
}
}
