제출 #887847

#제출 시각아이디문제언어결과실행 시간메모리
887847vjudge1Koala Game (APIO17_koala)C++17
4 / 100
3 ms344 KiB
#include "koala.h" #include<bits/stdc++.h> using namespace std; const int mxn = 123; int a[mxn], b[mxn]; int minValue(int n, int w) { a[0] = 1; fill(a+1, a+n, 0); playRound(a, b); if(b[0] <= 1) { return 0; } for(int i = 1; i < n; i++) { if(!b[i]) { return i; } } } int maxValue(int n, int w) { } int greaterValue(int n, int w) { } 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 maxValue(int, int)':
koala.cpp:29:1: warning: no return statement in function returning non-void [-Wreturn-type]
   29 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:34:1: warning: no return statement in function returning non-void [-Wreturn-type]
   34 | }
      | ^
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
#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...