Choptsticks with dynamic programming

I realize I suck at algorithms. I have this assignment that I can't get the picture in my head. I want to comprehend the chopsticks algorithm from UVA.
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1212

I have the solution already in spanish and it works, already made the test cases and all. The problem is that I don't quite understand what to do in case of more persons and reducing the badness at minimum.

>>3
no
>>4
I think you misundertood me. What I meant with dynamic programming wasn't to solve something with a dynamic programming language.
Dynamic programming in algorithms, more or less, is a method of programming that breaks the recursivity by including Memorization.

http://en.wikipedia.org/wiki/Dynamic_programming

Anyways, if someone has a way of explaining to me that particular problem i'll be awesome.
The problem is named:
10271 - Chopsticks

Thanks /prog/