Hi, Codeforces!

I have a question that most of you might find it very easy, about problem 489C - Given Length and Sum of Digits...

I'm actually still a newbie at solving Div2-C problems, since then I would be very glad if someone of you can help me with my question.

The question is: How does the DP approach of this problem differ than the greedy one written in problem's tutorial?

Thanks all, thanks in advance for this great community funded by your contributions!

Good luck with today's round btw ;)