Description: Josephus problem: Let numbered 1,2,3, ... ..., n of n (n> 0) individuals sitting around a circle clockwise, each person holds a positive integer password. Choose the beginning of a positive integer as the maximum number of reported m, starting clockwise from the first person from a report from the sequence number, m is the stop newspaper to report the number of people reported m out of line, his password as the new m value, the next person from the beginning of his re-reported from a number. This continues until all the columns all up. Let n be the maximum take 30. To design a program to simulate this process, find out the column number sequence.
To Search:
File list (Check if you may need any files):
约瑟夫环问题\ti22.cpp
............\ti2.cpp
约瑟夫环问题
Download