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.

约瑟夫环问题\ti22.cpp
............\ti2.cpp
约瑟夫环问题

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．