# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389256 | balbit | XOR Sum (info1cup17_xorsum) | 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>
#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 1;
}
// if (query ({1})) return 1;
// return N;
}