Problem Description: Josephus ordered a new problem definition is as follows: Suppose n individuals arranged in a ring, given a positive integer m, from the first one Begins with individuals along the ring count, when confronted with the first m individuals let their out of line, then automatically add a calculator m, and the count continued into the OK go on. This process continues until all of them out of the column until the last person out of the column as a winner. This set up the individual numbers n Respectively, 1 ~ n, each number is one from the race have begun to count, then the order of each person out of the column is defined as an integer 1 ~ n An array. This arrangement is called a (n, m) Josephus arranged. For example, (7,3) Josephus arranged as 3,7,6,2,4,1,5. For a given 1,2, ..., n in the k-number, Josephus would like to know whether there is a positive integer m makes the (n, m) Josephus arranged in exactly the number of pre-k this for a pre-specified k number

josephus.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．