| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1285795 | sunflower | Easter Eggs (info1cup17_eastereggs) | C++17 | 0 ms | 0 KiB |
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
int findEgg(int n, vector <pair <int, int>> edges) {
FOR(i, 1, n - 1) if (query({i})) return i;
return n;
}
