Joseph Central, a description of the problem is: No. 1,2, ┅, n of n individuals according to a clockwise direction around a circle. Choose a positive integer as the reported maximum number of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 reported the number of reported back m the number of stops. Reported m the list of people, from his in a clockwise direction on the next person started to count off from 1, and so on, until all the column until all.

Packet : 49636965shiy2.rar filelist
shiyan.c
readme.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．