No. 1,2, ... n of the n individuals in a clockwise direction around a circle, one person holding a password. One began to choose a positive integer as the number of reported upper limit m, from the first to embark on the clockwise direction since the beginning of the order of one off, back off m stop. reported m the person out of his password as the new m value, from him in a clockwise direction on the next person started to count off from one, it goes on like this until all the column until all.

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