제출 #103228

#제출 시각아이디문제언어결과실행 시간메모리
103228turbat커다란 상품 (IOI17_prize)C++14
0 / 100
86 ms512 KiB
#include "prize.h" int find_best(int n) { for(int i = 0; i < n; i++){ std::vector<int> res = ask(i); if(res[0] + res[1] == 0) return i;} return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...