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.

Dynamic Programming -> Exponential growth -> Finance -> Federal  Reserve System -> United States dollar -> World War II -> The Holocaust -> Jews

Only seven degrees of separation between dynamic programming and JEWS (note: seven is a sacred number in Jewish mythology). Can there be any question that >>1 is a kike?