| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1139563 | tkm_algorithms | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#include "grader.cpp"
using namespace std;
int findEgg (int N, vector < pair < int, int > > bridges)
{
int x = 0;
//int ans = 0;
for (int i = 1; i <= N; ++i) {
x = query({i});
if (x)return i;
}
//return ans;
}
