送交者: mangolasi 于 2006-3-04, 13:22:15:

回答: Squirrel's first step is a good start. 由 mangolasi 于 2006-3-04, 13:06:44:

start from {11,0,0,0} (1 way)

take one coin from 11, hence{10,1,0,0}

take 2 coins from 11, hence 2 way:{9,1,1,0} {9,2,0,0}, which can be view as either take 2 coins from 11 {11,0,0,0} to fill one 0, or take 1 coins from {10,1,0,0} to fill one 0--{9,1,1,0}

take 3 coins from 11, hence 3 ways {8,3,0,0},{8,2,1,0},{8,1,1,1}, which can be seen as take 3 coins from 11 {11,0,0,0} to fill one 0, or take 2 coins from 10 of {10,1,0,0} to fill one 0--{8,2,1,0}, or 1 coin from 9 of {9,1,1,0} to fill one 0.

recursively until you reach {3,3,3,2}.

• Forget to add a condtion of stopping taking: when the # you take - mangolasi (111 bytes) 2006-3-04, 13:28:05

加跟贴