Description: Joseph (Josephus) Central issue: numbered 1,2,3, ..., n of n individuals sitting around the circle clockwise, each holding a password (positive integer). Choose a positive integer beginning, as reported upper limit of the number of m, starting from the first person clockwise order starting from a report number, report m, stop. Who reported m out of the column, his password as the new m values in the clockwise direction from his next began to re-number from a newspaper, it goes on until everyone up all the columns. N individuals set up round robin list storage structure, operation after the output sequence number of people out of team
To Search:
File list (Check if you may need any files):
Compute.cpp