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 <vector>
using namespace std;
vector<int> coin_flips(vector<int> b,int c)
{
int cur=0;
for (int i=0;i<64;i++)
{
if (b[i])
cur^=i;
}
return vector<int>({cur^c});
}
int find_coin(vector<int> b)
{
int cur=0;
for (int i=0;i<64;i++)
{
if (b[i])
cur^=i;
}
return cur;
}
# | 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... |