Description: You are now use the list is the basis of Joseph ring, and the specific function for:
Numbers for 1, 2,...... , n n personal according to a circle round clockwise, everyone has one and only a password (positive integer). A began to choose a positive integer number off as the upper, from the first person clockwise direction since 1 began to sound off, report when m stop count off. The man stood for m, the password as new m value, clockwise from him in the next man began to sound off again, and so on, until all the people stood all so far
If the input integer data: 1 2 3 4 5 6, 4 3 1 output for 2 5 6
To Search:
File list (Check if you may need any files):
Joseph.cpp
Download