Submission #466155

#TimeUsernameProblemLanguageResultExecution timeMemory
466155nonsensenonsense1코알라 (APIO17_koala)C++17
4 / 100
5 ms200 KiB
#include "koala.h"

const int N = 100;
int a[N], r[N];

int minValue(int n, int w) 
{
	a[0] = 1;
	a[1] = 0;
	playRound(a, r);
	if (r[0] != 2) {
		a[0] = 0;
		a[1] = 1;
		playRound(a, r);
	}
	for (int i = 0; i < n; ++i) if (!r[i]) return i;
	return -1;
}

int maxValue(int n, int w) 
{
	return 0;
}

int greaterValue(int n, int w) 
{
	return 0;
}

void allValues(int n, int w, int *p) 
{
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...