Joseph Ring Joseph, a description of the problem is: numbered 1,2,3 ... ... n-individuals sitting in a circle clockwise, each holding a password. Choose a positive integer beginning, as the reported maximum number of m, from the first individual to embark on the clockwise direction starting from a report number, report the number m to stop reporting. Who reported m out of the column, his password as the new m value, from his next person clockwise to re-start from a number of reports, this continues until all the listed owner.

编程2.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．