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 "coins.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> coin_flips(std::vector<int> b, int c)
{
int x = 0;
for(int i = 0 ; i < 64 ; i++)
if( b[i] == 1 ) x ^= i;
return vector<int>( 1 , x^c );
}
int find_coin(std::vector<int> b)
{
int ans = 0;
for(int i = 0 ; i < 64 ; i++)
if( b[i] == 1 ) ans ^= i;
return ans;
}
# | 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... |