Known n individuals (numbered 1, 2, 3... N) are sitting around a round table. From the number of K (k<n) of people from 1 to start off, the man out of the line to the m; his next person from 1 to start off, count to m that another person out; so law be repeated until all of the people out around the table. Try to design the algorithm according to the column order output number.

约瑟夫环.txt

• 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．