Description: Purpose of the experiment
Familiar linear form of basic operations on a sequential storage structure and chain storage structure to achieve the various operations, which focus on familiar linked list.
Time requirements: 4 hours
Description of the problem:
Joseph (Joseph) a description of the problem: the number 1, 2, 3, ..., n n people sit in a circle in a clockwise direction, the person holding a password <positive integer> beginning choose one positive integer as the upper limit of m countin clockwise direction starting from the first person since the start sequence reported report m stop reported that the number of reported m the person out of the line, his password as the new value of m , starting from the next person in a clockwise direction from 1 reported that the number of re-it goes on, until everyone is all out of the line so far. Try to design a program that determined the order of columns.
Basic requirements:
The use of one-way circular linked list storage struc
To Search:
File list (Check if you may need any files):
实验一 线性表实验\实验一.dsp
.................\Debug\vc60.idb
.................\.....\vc60.pdb
.................\.....\实验一.pch
.................\.....\实验一.obj
.................\.....\实验一.ilk
.................\.....\实验一.exe
.................\.....\实验一.pdb
.................\实验一.ncb
.................\实验一.plg
.................\实验一.opt
.................\实验一.dsw
.................\choice.cpp
.................\Debug
实验一 线性表实验
Download