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 b[c]
if (b[c] == 1) {
// si b[c] = 1, hacemos que b[c] sea igual a 0 y que el resto sean 1s
b[c] = 0;
for (int i = 0; i <= 63; i++) {
if (b[i] == 0 && i != c) {
flips.push_back(i);
}
}
} else {
// hacemos que b[c] sea igual a 1 y que el resto sean 0s
b[c] = 1;
for (int i = 0; i <= 63; i++) {
if (b[i] == 1 && i != c) {
flips.push_back(i);
}
}
}
return flips;
}
int find_coin(vector<int> b) {
for (int i = 0; i <= 62; i++) {
if (b[i] == 1) return i;
}
return 63;
}
# | 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... |