# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433493 | Kanaifu | Coins (IOI17_coins) | 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.cpp"
#include "coins.h"
using namespace std;
std::vector<int> coin_flips(std::vector<int> b, int c)
{
int board = 0;
for (int pos=0; pos<64; pos++)
{
if (b[pos])
{
board = board ^ pos;
}
}
int change = board ^ c;
vector <int> nov = {change};
return nov;
}
int find_coin(std::vector<int> b) {
int board = 0;
for (int pos=0; pos<64; pos++)
{
if (b[pos])
{
board = board ^ pos;
}
}
return board;
}
/*
3
0
11101101
01000010
01011010
11110101
11000010
01011101
01000110
10111111
7
01110010
11110101
00000100
10110001
00010111
00110101
00001110
10101110
7
00000000
00000000
00000000
00000000
00000000
00000000
00000000
00000000
*/