Description: Joseph Central (Joseph) a description of the problem is: numbered 1,2, ..., n of n individuals according to a clockwise direction around a circle, each holding a password (positive integer). The beginning of a positive integer as a candidate at a number of upper limit of m, from the first individual to embark on the clockwise direction since the beginning of the order of 1 is reported the number of stops required to report back at a few m. Those who reported m out of his password as the new value of m, in a clockwise direction from the next person to start off again from the 1, and so on, until all that out until all. Try to design a procedure to derive the column order
To Search:
- [1571] - powerful VC chat room procedures, includ
- [c] - To the adjacent multi-table for the stor
- [Kasami] - Kasami sequence generator using matlab
- [PN] - PN sequence generator using matlab
- [e] - Comparison of internal sorting algorithm
File list (Check if you may need any files):
03052030.cpp
上机报告--约瑟夫环问题.doc
Download