# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
890553 | Iwantbemaster | Easter Eggs (info1cup17_eastereggs) | C++17 | 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>> brid){
for(int i = 1; i <= n; i++){
vector<int> res; res.emplace_back(i);
if(query({res})) return i;
} return n;
}