Problem 2468 · Hard
Find the fewest parts whose <i/k> suffixes leave room for the whole message, then fill each part.
Open the interactive visualisation