| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
|
0
If there are multiple solutions it will still work, but it would not necessarily return the minimum. What the other guy said about brute forcing basis vectors should still be much faster than the naive solution in this case. |
|
+1
You would create a system of equations over GF(2) and solve. Look up lights out puzzle, I believe this is just a modified version. |
|
+1
brute force the first problem binary search the second problem |
|
0
cold and boring, 7/10 |
|
0
i practice on other platforms |
|
0
solve harder problems |
|
0
I am 12. Nice to meet you! |
| Name |
|---|


