question stringclasses 2
values | answer stringclasses 2
values |
|---|---|
In an $11 \times 11$ grid of cells, each pair of edge-adjacent cells is connected by a door. Karthik wants to walk a path in this grid. He can start in any cell, but he must end in the same cell he started in, and he cannot go through any door more than once (not even in opposite directions). Compute the maximum number... | 200 |
Compute the number of ways to pick two rectangles in a $5 \times 5$ grid of squares such that the edges of the rectangles lie on the lines of the grid and the rectangles do not overlap at their interiors, edges, or vertices. The order in which the rectangles are chosen does not matter. | 6300 |
README.md exists but content is empty.
- Downloads last month
- 4