Description: Joseph (Joseph) a description of the problem is: numbered 1,2 ,..., n of n individuals sitting around a circle clockwise, each holding a password (positive integer). The beginning of a positive integer as the selection of the number of reported upper limit of m, starting from the first person clockwise order starting from a number of newspaper, newspaper to report the number of m to stop. Who reported m out of line, it' s password as the new m value, and then start a new one from the reported number of individuals, and so forth, until the last one remaining was the winner. Design a program list find out the order.
To Search:
File list (Check if you may need any files):
exp1约瑟夫问题
..............\Debug
..............\exp1.dsp
..............\exp1.dsw
..............\exp1.ncb
..............\exp1.opt
..............\exp1.plg
..............\exp1约瑟夫问题.jpg
..............\hm.cpp
Download