Problemcore
Printing neatly (optimal line breaking)
Also called Printing neatly.
Breaking a paragraph of words into lines to minimize the total penalty from extra spaces, solved by dynamic programming.
Breaking a paragraph of words into lines to minimize the total penalty from extra spaces, solved by 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 R1T36V Edit this page History Report an error