Description: 2, Joseph (Josephus) Central Question: numbered 1,2,3, ..., n, n individuals sitting clockwise circle, each holding a password (positive integer). An optional start a positive integer as the number of reported upper limit of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report m stop. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction, the next began to re-reported from a few, and so it goes, until all of the column until all the up. The establishment of n individual single-loop list storage structure, operation after the end of the output turn out the team' s serial number.
To Search:
File list (Check if you may need any files):
我的第2.c
Download