#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
1364 KB |
Output is correct |
2 |
Correct |
6 ms |
1696 KB |
Output is correct |
3 |
Correct |
6 ms |
1684 KB |
Output is correct |
4 |
Correct |
6 ms |
1696 KB |
Output is correct |
5 |
Correct |
6 ms |
1688 KB |
Output is correct |
6 |
Correct |
6 ms |
1696 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
1364 KB |
Output is correct |
2 |
Correct |
6 ms |
1696 KB |
Output is correct |
3 |
Correct |
6 ms |
1684 KB |
Output is correct |
4 |
Correct |
6 ms |
1696 KB |
Output is correct |
5 |
Correct |
6 ms |
1688 KB |
Output is correct |
6 |
Correct |
6 ms |
1696 KB |
Output is correct |
7 |
Correct |
6 ms |
1692 KB |
Output is correct |
8 |
Correct |
8 ms |
1684 KB |
Output is correct |
9 |
Correct |
6 ms |
1688 KB |
Output is correct |
10 |
Correct |
6 ms |
1688 KB |
Output is correct |
11 |
Correct |
6 ms |
1688 KB |
Output is correct |
12 |
Correct |
6 ms |
1684 KB |
Output is correct |
13 |
Correct |
6 ms |
1688 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
1364 KB |
Output is correct |
2 |
Correct |
6 ms |
1368 KB |
Output is correct |
3 |
Correct |
6 ms |
1356 KB |
Output is correct |
4 |
Correct |
6 ms |
1368 KB |
Output is correct |
5 |
Correct |
6 ms |
1364 KB |
Output is correct |
6 |
Correct |
6 ms |
1364 KB |
Output is correct |
7 |
Correct |
6 ms |
1364 KB |
Output is correct |
8 |
Correct |
6 ms |
1356 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
1360 KB |
Output is correct |
2 |
Correct |
6 ms |
1356 KB |
Output is correct |
3 |
Correct |
6 ms |
1356 KB |
Output is correct |
4 |
Correct |
6 ms |
1368 KB |
Output is correct |
5 |
Correct |
6 ms |
1356 KB |
Output is correct |
6 |
Correct |
6 ms |
1364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
1364 KB |
Output is correct |
2 |
Correct |
6 ms |
1696 KB |
Output is correct |
3 |
Correct |
6 ms |
1684 KB |
Output is correct |
4 |
Correct |
6 ms |
1696 KB |
Output is correct |
5 |
Correct |
6 ms |
1688 KB |
Output is correct |
6 |
Correct |
6 ms |
1696 KB |
Output is correct |
7 |
Correct |
6 ms |
1692 KB |
Output is correct |
8 |
Correct |
8 ms |
1684 KB |
Output is correct |
9 |
Correct |
6 ms |
1688 KB |
Output is correct |
10 |
Correct |
6 ms |
1688 KB |
Output is correct |
11 |
Correct |
6 ms |
1688 KB |
Output is correct |
12 |
Correct |
6 ms |
1684 KB |
Output is correct |
13 |
Correct |
6 ms |
1688 KB |
Output is correct |
14 |
Correct |
6 ms |
1684 KB |
Output is correct |
15 |
Correct |
6 ms |
1696 KB |
Output is correct |
16 |
Correct |
6 ms |
1692 KB |
Output is correct |
17 |
Correct |
6 ms |
1660 KB |
Output is correct |
18 |
Correct |
6 ms |
1688 KB |
Output is correct |
19 |
Correct |
6 ms |
1688 KB |
Output is correct |
20 |
Correct |
6 ms |
1700 KB |
Output is correct |
21 |
Correct |
6 ms |
1700 KB |
Output is correct |
22 |
Correct |
7 ms |
1688 KB |
Output is correct |
23 |
Correct |
6 ms |
1688 KB |
Output is correct |
24 |
Correct |
6 ms |
1696 KB |
Output is correct |
25 |
Correct |
8 ms |
1528 KB |
Output is correct |