Description: 2, Joseph (Josephus) Central question: numbered 1,2,3, ..., n n individuals clockwise direction around a circle, each holding a password (positive integer). An optional start a positive integer as the upper limit of the number m, from the first person to start a clockwise direction from the beginning of the order number, report m stop. M out of newspaper columns, his password as the new value of m, starting from the next person on his re-clockwise direction from one number off, and so on, until all the columns so far. N round robin to establish a personal list storage structure, after the end of the run, the output sequence number of people out of the team.
To Search:
File list (Check if you may need any files):
test2.cpp
Download