1participants who submitted
11judged submissions
6accepted
55%acceptance rate
Solutions per problem
| # | Problem | Solvers | Tried by | Attempts | First solved |
|---|---|---|---|---|---|
| A | Pairwise Swap | 1 | 1 | 1 | 0:05 by Spidu |
| B | Bounding Box | 1 | 1 | 2 | 0:13 by Spidu |
| C | All the Rectangles | 1 | 1 | 5 | 1:17 by Spidu |
| D | N-th Gray Code | 1 | 1 | 1 | 1:39 by Spidu |
| E | Longest Distinct Stretch | 1 | 1 | 2 | 1:47 by Spidu |
| F | Closest Pair Sum | 0 | 0 | 0 | — |
| G | Counting Subsets with Given Sum | 0 | 0 | 0 | — |
| H | Remove Two, Five, or Six | 0 | 0 | 0 | — |
| I | Misere Nim | 0 | 0 | 0 | — |
| J | Avoid the Set {012, 210} | 0 | 0 | 0 | — |