Description: Monkey off his first day of a number of peach, half eaten immediately, not good enough, and eat one. The next morning in turn eaten by the remaining peach half, then eat one. After the morning before the rest of the day to eat a half a zero. When the tenth day in the morning want to eat, see only one peach. Seeking first day total of how many pick peaches. c++, reverse thinking
To Search:
File list (Check if you may need any files):
猴子吃桃问题2.cpp
猴子吃桃问题的递归解决.cpp
猴子吃桃问题的递归解决.dsp
猴子吃桃问题的递归解决.dsw
猴子吃桃问题的递归解决.ncb
猴子吃桃问题的递归解决.opt
猴子吃桃问题的递归解决.plg
猴子吃挑问题1.cpp
Download