#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 f = c;
for(int i = 0 ; i < (int)b.size() ; i++){
if(b[i]) f ^= i;
}
vector <int> ret = {f};
return ret;
}
int find_coin(std::vector<int> b) {
int x = 0;
for(int i = 0 ; i < (int)b.size() ; i++){
if(b[i]) x ^= i;
}
return x;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
1464 KB |
Output is correct |
2 |
Correct |
13 ms |
1512 KB |
Output is correct |
3 |
Correct |
12 ms |
1464 KB |
Output is correct |
4 |
Correct |
13 ms |
1456 KB |
Output is correct |
5 |
Correct |
11 ms |
1496 KB |
Output is correct |
6 |
Correct |
11 ms |
1332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
1464 KB |
Output is correct |
2 |
Correct |
13 ms |
1512 KB |
Output is correct |
3 |
Correct |
12 ms |
1464 KB |
Output is correct |
4 |
Correct |
13 ms |
1456 KB |
Output is correct |
5 |
Correct |
11 ms |
1496 KB |
Output is correct |
6 |
Correct |
11 ms |
1332 KB |
Output is correct |
7 |
Correct |
12 ms |
1340 KB |
Output is correct |
8 |
Correct |
12 ms |
1456 KB |
Output is correct |
9 |
Correct |
13 ms |
1604 KB |
Output is correct |
10 |
Correct |
13 ms |
1464 KB |
Output is correct |
11 |
Correct |
12 ms |
1476 KB |
Output is correct |
12 |
Correct |
5 ms |
1328 KB |
Output is correct |
13 |
Correct |
11 ms |
1456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
1456 KB |
Output is correct |
2 |
Correct |
12 ms |
1464 KB |
Output is correct |
3 |
Correct |
12 ms |
1520 KB |
Output is correct |
4 |
Correct |
12 ms |
1328 KB |
Output is correct |
5 |
Correct |
12 ms |
1476 KB |
Output is correct |
6 |
Correct |
12 ms |
1592 KB |
Output is correct |
7 |
Correct |
11 ms |
1456 KB |
Output is correct |
8 |
Correct |
11 ms |
1468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
1464 KB |
Output is correct |
2 |
Correct |
11 ms |
1468 KB |
Output is correct |
3 |
Correct |
12 ms |
1344 KB |
Output is correct |
4 |
Correct |
12 ms |
1348 KB |
Output is correct |
5 |
Correct |
12 ms |
1492 KB |
Output is correct |
6 |
Correct |
12 ms |
1480 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
1464 KB |
Output is correct |
2 |
Correct |
13 ms |
1512 KB |
Output is correct |
3 |
Correct |
12 ms |
1464 KB |
Output is correct |
4 |
Correct |
13 ms |
1456 KB |
Output is correct |
5 |
Correct |
11 ms |
1496 KB |
Output is correct |
6 |
Correct |
11 ms |
1332 KB |
Output is correct |
7 |
Correct |
12 ms |
1340 KB |
Output is correct |
8 |
Correct |
12 ms |
1456 KB |
Output is correct |
9 |
Correct |
13 ms |
1604 KB |
Output is correct |
10 |
Correct |
13 ms |
1464 KB |
Output is correct |
11 |
Correct |
12 ms |
1476 KB |
Output is correct |
12 |
Correct |
5 ms |
1328 KB |
Output is correct |
13 |
Correct |
11 ms |
1456 KB |
Output is correct |
14 |
Correct |
12 ms |
1328 KB |
Output is correct |
15 |
Correct |
12 ms |
1468 KB |
Output is correct |
16 |
Correct |
13 ms |
1464 KB |
Output is correct |
17 |
Correct |
12 ms |
1456 KB |
Output is correct |
18 |
Correct |
12 ms |
1480 KB |
Output is correct |
19 |
Correct |
12 ms |
1580 KB |
Output is correct |
20 |
Correct |
12 ms |
1332 KB |
Output is correct |
21 |
Correct |
12 ms |
1456 KB |
Output is correct |
22 |
Correct |
11 ms |
1456 KB |
Output is correct |
23 |
Correct |
12 ms |
1472 KB |
Output is correct |
24 |
Correct |
11 ms |
1516 KB |
Output is correct |
25 |
Correct |
11 ms |
1456 KB |
Output is correct |