Introduction - If you have any usage issues, please Google them yourself
Description : Let numbered 1, 2, ..., n (NGT; 0) clockwise direction by individuals sitting around a circle, each holding a positive integer code. At the beginning of a given arbitrary reported few limits on m, started from the first clockwise direction from the starting sequence reported a few, when they report back m reported few, hold out the m out from the clockwise direction in the next personal re-order starting from a newspaper; This situation continues until all people so far shown up. Asked to design a simulation of this process, and give out the number of people out sequence. . Algorithm thinking : Jeseph function is to seek to achieve the main function of the algorithm is thinking : m from a right to take the lead in the 19th nodes Listless cycle count, m, the output node number
Packet : 55593386josephus.1.rar filelist
josephus\w.c
josephus\Debug
josephus\w.ncb
josephus\w.plg
josephus\josephus报告.doc
josephus\w.dsp
josephus\w.opt
josephus\w.dsw
josephus