Description: Tasks: number is 1, 2, ......, n of n people sitting clockwise circle, each person only a password (a positive integer). The beginning optionally a positive integer as the number off the upper limit m still start from the first clockwise order of the number of reported since 1 report m the number of stop message. The reported m people out of the line, his password as the new value of m, starting from the next person in a clockwise direction from a number of reported again, and so on, until all the columns so far. Design a program to derive the column order.
Requirements: one-way circular linked list storage structure to simulate this process, the number of individuals in accordance with the order of the columns output.
Test data:
the initial value of 20 m, n = 7, 7 personal password followed by 3,1,7,2,4,7,4, first of all m = 6, then what is the correct output?
Requirements:
Input data: input processing input data, enter the initial value of m, n, enter a password for each person,
To Search:
File list (Check if you may need any files):
Josephus problem\20102344049-封其业-joseph环.doc
................\KMT.cpp
Josephus problem
Download