# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111422 | Segtree | Koala Game (APIO17_koala) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
#include"koala.h"
using namespace std;
typedef long long ll;
int B[110],R[110];
int minValue(int N,int W){
for(int i=1;i<N;i++){B[i]=0;} B[0]=1;
playRound(B,R);
for(int i=0;i<N;i++){
if(R[i]==0)return i;
}
}
int maxValue(int N,int W){
}
int greaterValue(int N,int W){
}
int allValues(int N,int W,int P){
}
/*
int main(){
return 0;
}*/