Description: Joseph Ring
Joseph, a description of the problem is: numbered 1,2,3 ... ... n-individuals sitting in a circle clockwise, each holding a password. Choose a positive integer beginning, as the reported maximum number of m, from the first individual to embark on the clockwise direction starting from a report number, report the number m to stop reporting. Who reported m out of the column, his password as the new m value, from his next person clockwise to re-start from a number of reports, this continues until all the listed owner.
To Search:
File list (Check if you may need any files):
编程2.txt
Download