Description: Josephus (Josephus) a description of the problem is: numbered 1,2, ..., n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose the beginning of a positive integer number as reported on the limit m, starting from the first person in a clockwise direction starting from a report number, report m, the number of stops reported. Reported m the person out of the column, his password as the new value of m, in a clockwise direction from the next person he began to re-reported from a number, it goes on, until all the people all of the columns so far. Design a program, according to the column order prints each number.
To Search:
File list (Check if you may need any files):
yusefusi.cpp
Download