Problemintro
Counting paths on grids with obstacles
Problem of counting monotone routes across a grid while avoiding blocked cells, solved with dynamic programming.
Problem of counting monotone routes across a grid while avoiding blocked cells, solved with dynamic programming.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 3TFVRQ Edit this page History Report an error