Description: Josephus (Josephus) a description of the problem are: number 1,2, ..., n of n individuals sitting around a circle clockwise, each holding a password (positive integer). Choose a positive integer beginning as a limit on the number of reported m, starting from the first person to start a clockwise direction from a report number, report the number of reported m stop. Who reported m out of line, his password as the new m value, in a clockwise direction from the next person he began to re-reported from a number, it goes on until all the people all of the columns so far. Design a program, according to the column order prints each number.
To Search:
File list (Check if you may need any files):
第一次作业\1111.C
..........\1111.exe
..........\1112.C
..........\1112.exe
..........\~$约瑟夫斯问题.doc
第一次作业
Download