# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890554 | Iwantbemaster | Easter Eggs (info1cup17_eastereggs) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int findegg(int N, vector<pair<int, int>> bridges){
for(int i = 1; i <= N; i++){
vector<int> res; res.emplace_back(i);
if(query ({res})) return i;
} return n;
}