Introduction - If you have any usage issues, please Google them yourself
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)
Packet : 4999201229_bfs.rar filelist
1229_bfs.cpp