Grid Paths I
Number of right/down paths from the upper-left to the lower-right square of an `n × n` grid avoiding traps, modulo `10^9 + 7`. Input: `trap[i][j]`.
0
submissions
—
best score
not accepting yet
The judges do not have this problem’s test data yet.
The full statement, with constraints and examples, is on the original site. The specification is at TalosEval/Problems/CSES/GridPathsI/Spec.lean.
Results
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.