Joseph problems numbered 1,2, ... ..., n of n individuals according to a clockwise direction around a circle, one person holding a password (positive integer). One began to choose a positive integer as the number of reported upper limit of m, from the first individual to embark on the clockwise direction since the beginning of the order of one off. Method 1. Reported that the number of people out of m column (to remove), from him in a clockwise direction on the next person started to count off from 1, ... ..., it goes on like this until all the column until all. Try to design a procedure to derive the column order. Require the use of one-way linked list storage structure simulation cycle of this process, in accordance with a print out the order of their number and this person password.

Packet : 19854831yosehu.rar filelist
约瑟夫问题\main.cpp
约瑟夫问题\约瑟夫问题.opt
约瑟夫问题\CNode.cpp
约瑟夫问题\约瑟夫问题.dsp
约瑟夫问题\CNode.h
约瑟夫问题\linkedlist.h
约瑟夫问题\约瑟夫问题.ncb
约瑟夫问题\linkedlist.cpp
约瑟夫问题\约瑟夫问题.plg
约瑟夫问题\约瑟夫问题.dsw
约瑟夫问题\main1.cpp
约瑟夫问题\Debug
约瑟夫问题

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