t's numbered 1, 2... N's n individual sits in a clockwise circle, each holding a password (positive integer). One began to choose a positive integer as the number of the upper limit of M, starting from the first person in a clockwise direction from 1 to the beginning of the order number, back off m stop. Who reported m out of line, his password as the new m value, from the next person in a clockwise direction began to count off from 1, and so on, until all the columns so far.

Filename	Size	Update
约瑟夫环.cpp	1355	2017-10-17
题目说明.docx	11298	2017-12-25

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