Description: Data structure test report Joseph ring
Problem description:
A description of Joseph's problem is: number 1, 2,... N individuals sit in a circle clockwise, each holding a password (positive integer). At the beginning, choose a positive integer as the limit value in the number of Numbers. From the first person, start the number in clockwise direction from 1, then stop the number when reporting to m. The person who reported to m went out and took his password as the new m value, starting from the next person in the clockwise direction and starting to re-count from l, so that until everyone was out of the line. Try to design a program to find out the column order.
Basic requirements:
The process is simulated by using a one-way loop linked list storage structure, and each person's number is printed in sequence.
Test data:
The initial value of m is 20; N = 7, 7 passwords in turn: 3, 1, 7, 2, 4, 8, 4 (the correct order should be 6, l, 4, 7, 2, 3, 5).
To Search:
- [smallprograms.Rar] - 2.1 n personal cordons m not yet entered
- [ldf19870326] - A source code for Joseph's problem witho
- [UniBtn] - Realize arbitrary irregular shape button
- [phoneView] - The phone book for beginners, please exh
- [shiyan1-1] - Joseph Central source, the data structur
File list (Check if you may need any files):
Download