Description: Josephus (Josephus) a description of the problem: the number 1,2, ..., n n people sit in a circle in a clockwise direction, the person holding a password (a positive integer). Beginning optionally a positive integer as the upper limit of m in the reported number, starting from the first person clockwise direction since a reported number, the report m stop the reported number. The reported m dequeue his password as the new value of m from the next person clockwise to start again from 1 number off, it goes on, until all of the people all of the columns so far. Try to design a program to print out each number dequeue order.
To Search:
File list (Check if you may need any files):
main.c
Download