# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890559 | 2023-12-21T13:11:51 Z | Iwantbemaster | Easter Eggs (info1cup17_eastereggs) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; int findegg(int n, vector<pair<int, int>> bridges){ for(int i = 1; i <= n; i++){ if(query ({i})) return i; } return n; }