Description: 1, Joseph is a description of the problem: number 1,2,3-, n of n individuals sitting around the circle clockwise,
Each person has a password (positive integer). Choose the beginning of a positive integer value as reported on the line number m, from the first
Reported a clockwise direction starting number, to report m, the number of stops reported. Reported m the person out of the column, as his new password
m value, in the clockwise direction from his personal resume on the next number from a newspaper, and so on, until all
All the columns.
2, the program runs, the first requires the user to specify a limit on the number of the initial report, then read a personal password. Can be set n ≤ 30.
3, the test data: m = 20 n = 7 password once: 3,1,7,2,4,8,4.
To Search:
File list (Check if you may need any files):
c++.doc
Download