Description: n stones (each of the two adjacent distance of a meter, the most edge of the rocks and the shore is a distance meters), gifts m on the first stone, the frog first time i jump 2* i-1 meter. Gifts can be asked. (NGT; = 49 gift can be sure , 4; 49, zheng or recursive)
- [1222] - for n! The lowest number is not 0. Use m
- [1307] - keep the six items (1* 2* 2* 6 .... 6) A
- [Rect] - an applet
File list (Check if you may need any files):
Download