Joseph Ring (Joseph) a description of the problem is: No. 1,2, ┉, n of n individuals sitting around a circle clockwise, each person has a password (positive integer), the start and either a positive integer value, as reported on line number m, from the first individual to embark on the clockwise direction starting from an order of the number reported, report the number of m, to stop reporting. Who reported m dequeuing his password as the new m value, clockwise from him the next person on the re-start at 1 count off, it goes on, until the owner of all the columns up. Design a program calculated the column order.

joseph.c

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