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<vector>
using v=std::vector<int>;int x=0;
v coin_flips(v b, int c){for(int i=0;i<64;i++)c^=b[i]*i;return{c};}
int find_coin(v a){x=0;for(int i=0;i<64;i++)x^=a[i]*i;return x;}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |