Trial were linear vector table storage structure and the linked list storage structure to achieve, Joseph (Josephu) problem. Joseph question is as follows: There should be n individuals sitting around the round table. From a position of people began to count off a few people who will be out of the m columns, the next person (the first m+1 month) and from a newspaper a few started to m the number of people is the first two out of out of people, and so on, until the last one out of the column so far, so that you can get an officer ordered a new order. For example, n = 8, m = 4, several individuals from the first one and got a new order of 48,521,376.

pengyunhui-2-1.c
pengyunhui-2-2.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．