Description: The Joseph ring (Joseph problem) is a mathematical application problem: known n individuals (with numbered 1, 2, 3... N respectively) sit around a round table. K from a number of people start off, the man out of the line to the m; his next person and from 1 to start off, count to m that another person out; so law be repeated until all of the people out around the table. When we usually solve this kind of problem, we have the number from 0~n-1, and the final [1] result +1 is the solution of the original problem.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 实验1\字母表.cpp | 2371 | 2017-10-19
|
| 实验1\字母表.exe | 186701 | 2017-10-19
|
| 实验1\约瑟夫环.cpp | 1762 | 2017-10-19
|
| 实验1\约瑟夫环.exe | 184759 | 2017-10-19
|
| 实验1 |
Download