Description: The Wolf find rabbits problem: a mountain have n holes, clockwise Numbers for 0,1,2,3,4,... , n- 1.A Wolf from the zero number hole start, clockwise count, when after the first m a hole, hole to find a rabbit. For example, n = 5, m = 3, the Wolf through hole in turn is 0,3,1,4,2,0. Input m, n. Rabbits have surviving opportunity? If there is the hidden?
To Search:
File list (Check if you may need any files):
118_10
......\118_10.dsp
......\118_10.dsw
......\118_10.ncb
......\118_10.opt
......\118_10.plg
......\Debug
......\.....\118_10.exe
......\.....\118_10.ilk
......\.....\118_10.pch
......\.....\118_10.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\.....\狼找兔子.obj
......\狼找兔子.cpp
Download