| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1305255 | kaloyan | 커다란 상품 (IOI17_prize) | C++20 | 27 ms | 400 KiB |
#include "prize.h"
#include <cassert>
#include <random>
int find_best(int n)
{
while(true)
{
int idx = rand() % n;
auto v = ask(idx);
if(v[0] + v[1] == 0)
{
return idx;
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
