Coin-collecting by robot
第九组：张帆、汪志超、赵明祥、梁肇浩、李娟
问题描述
start
end
Upper left to bottom right
move each one cell to right or on cell down
as many coins as possible
0 1
3
4 5
1
2
3
4
2
0
数学建模
The recurrence:
a(i,j) =
或者，我们也可以在同一个方格里面放多个硬币
a(i,j)=
1 if there is a coin in cell(i,j)
0 if there is not a coin in cell(i,j)
k if there is some coins in cell(i,j)
0 if there is not a coin in cell(i,j)
