제출 #401170

#제출 시각아이디문제언어결과실행 시간메모리
401170Hazem코알라 (APIO17_koala)C++14
22 / 100
72 ms424 KiB
#include "koala.h" int B[100],R[100]; int minValue(int N, int W) { B[0] = 1; playRound(B,R); if(!R[0])return 0; else for(int i=0;i<N;i++) if(!R[i])return i; } int maxValue(int N, int W) { // TODO: Implement Subtask 2 solution here. // You may leave this function unmodified if you are not attempting this // subtask. return 0; } int greaterValue(int N, int W) { int l = 0,r = 14; while(l<r){ int mid = (l+r+1)/2; B[0] = B[1] = mid; playRound(B,R); if(R[0]!=R[1]) return R[0]<R[1]; if(R[0])l = mid; else r = mid-1; } int cnt = -1; while(1) cnt++; return cnt; } 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. } }

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
   13 | }
      | ^
#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...