# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389256 | 2021-04-14T01:44:10 Z | balbit | XOR Sum (info1cup17_xorsum) | C++14 | 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 1; } // if (query ({1})) return 1; // return N; }