Description: This procedure description specifically for Joseph problem: The serial number is 12, ... The n n individual surrounds the ready-made one circle according to the clockwise sense , each person holds (positive integer) a password, one positive integer beginning to assume a post of selections is upper limits ms numbering off, direction starts the hour hand beginning from the first people according to order from 1 numbering off in proper order , stop numbering off when reporting m, the person place column reporting m looks on his password as new m value , the individual begins to number off again from 1 , getting down like this from his time as soon as going ahead in clockwise sense, until proprietor all till leaving self s place in the ranks. Make use of one-way circulation chained list memory structure to simulate this process, according to that the order leaving self s place in the ranks prints out each person s serial number. Demonstrate the procedure interactive mode implementation wit
File list (Check if you may need any files):
yue.cpp
Download