Problem 2468 · Hard

Split Message Based on Limit

Find the fewest parts whose <i/k> suffixes leave room for the whole message, then fill each part.

Open the interactive visualisation