Old Top Coder riddle: Making a number by inserting +

Question

I am thinking about this topcoder problem.

Given a string of digits, find the minimum number of additions required for the string to equal some target n

Answer 1

I think the problem is similar to Matrix Chain Multiplication problem where we have to put braces for least multiplication. Here braces represent '+'. So I think it could be solved by similar dp approach.. Will try to implement it.