제출 #108350

#제출 시각아이디문제언어결과실행 시간메모리
108350RezwanArefin01코알라 (APIO17_koala)C++17
4 / 100
9 ms384 KiB
#include "koala.h" int minValue(int N, int W) { int p[N], q[N]; for(int i = 0; i < N; ++i) { p[i] = q[i] = 0; } p[0] = 1; playRound(p, q); for(int i = 0; i < N; ++i) { if(q[i] == 0) 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) { if (W == 2*N) { } else { } }
#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...