Description: 2, Joseph (Josephus) loop problem: number 1,2,3, ..., n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose the beginning of a positive integer as a limit on the number of reported m, starting from the first person clockwise order starting from a report number, report m, stop. Reported m the person out of the column, his password as the new value of m, in the clockwise direction from his next began to re-reported from a number, it goes on, until everyone all the columns up.
To Search:
File list (Check if you may need any files):
约瑟夫环\Josephus1.cpp
........\Josephus1.png
约瑟夫环
Download