Description: Josephus: The numbers 1, 2, 3, ..., of n of n individuals sitting around a circle in a clockwise direction, the person holding a code (positive integer). Opened
Beginning to Choose a positive integer m as the upper limit of the reported number of start from the first person in a clockwise direction since a start sequence number off the report m stop.
Reported m the person out of the line, the password as the new values of m from the next person in the clockwise direction from a number off again, it goes straight
To all until all the columns.
Single cycle of the n individuals linked list storage structure, after the end of the run, the output followed by the serial number of the team.
To Search:
File list (Check if you may need any files):
约瑟夫（Josephus）环问题 .cpp
Download