Description: Joseph Ring (Joseph) a description of the problem is: No. 1,2, ┉, n of n individuals sitting around a circle clockwise, each person has a password (positive integer), the start and either a positive integer value, as reported on line number m, from the first individual to embark on the clockwise direction starting from an order of the number reported, report the number of m, to stop reporting. Who reported m dequeuing his password as the new m value, clockwise from him the next person on the re-start at 1 count off, it goes on, until the owner of all the columns up. Design a program calculated the column order.
To Search:
File list (Check if you may need any files):
joseph.c
Download