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;
// Es obligatorio girar al menos una casilla => giremos una que no usemos
flips.push_back(63);
// Guardaremos c en binario en las primeras 6 casillas
for (int i = 0; i <= 6; i++) {
// Guardamos el valor del i-esimo digito binario de c
int valorDigito = (c & (1<<i)) >> i;
if (b[i] != valorDigito) {
flips.push_back(i);
}
}
return flips;
}
int find_coin(vector<int> b) {
// Convertimos la representacion binaria en decimal
int c = 0;
for (int i = 0; i <= 6; i++) {
c += (1<<b[i]);
}
return c;
}
# | 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... |