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"
using namespace std;
vector<int> coin_flips(vector<int> b, int c) {
vector<int> flips;
// Encontramos primero el XOR de los indices i tales que b[i] = 1
int val = 0;
for (int i = 0; i < 64; i++) {
if (b[i] == 1) {
val ^= i;
}
}
// Giramos una moneda para que este XOR sea c
// val XOR x = c
// val XOR val XOR x = val XOR c
// x = val XOR c = c XOR val
flips.push_back(val ^ c);
return flips;
}
int find_coin(vector<int> b) {
// Encontramos el XOR de los indices i tales que b[i] = 1
int val = 0;
for (int i = 0; i < 64; i++) {
if (b[i] == 1)
val ^= i;
}
return val;
}
# | 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... |