Known n individuals (represented by numbers 1, 2, 3,..., n) sit around a round table. K from a number of people start off, the man out of the line to the m; his next person and from 1 to start off, count to m that another person out; so law be repeated until all of the people out round table. Usually, when solving this kind of problem, we put numbers from 0~n-1, and finally [1] results +1, which is the solution of the original problem.

约瑟夫环1.cpp
约瑟夫环2.cpp
约瑟夫环.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．