Description: Has a number 1,2, ..., n of n (n> 0) individuals in a circle, each person holds a password m. The number of individual reports from the first start, stop newspaper report m the number of people who reported m out of laps, and then the next person from the beginning of his re-reported the number, appearance, stop reporting the number of m, at m of the circle, ... ..., and so on until all the circles all up. When any given n and m, the design algorithm for getting the order of n individuals a circle.
To Search:
File list (Check if you may need any files):
约瑟夫环.cpp
Download