Description: The Josephu problem is: set number 1, 2,... N individuals of N sit around, and the person whose agreed number is k (1 <= K <= n) counts from the beginning, and the person counting to m is listed. The next one counts from the beginning, and the person counting to m is listed again. By analogy, until all the people are listed, a sequence of queue numbers is produced.
Two way linked list solution

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: Input the letter expression, set up the expression tree and evaluate the expression.

Plat: C-C++ | Size: 16454KB | Downloads: 0

Description: Shanghai Jiao Tong University, OnlineJudge 1216

Plat: C-C++ | Size: 214KB | Downloads: 0

Description: Using the data characteristics of two fork sorting, statistics the number of elements in the two fork sort tree.

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: Application of data structure diagram

Plat: C-C++ | Size: 65KB | Downloads: 0

Description: 7-5 list weight (25 points)
Given a list of L with integer key values, you need to delete the key value nodes with absolute values. That is, for each key value K, only the first absolute value equal to K's node is preserved. At the same time, all deleted nodes must be saved on another list. For example, given L is 21 -15 -15 -7 15, you need to output the list 21 -15 -7 after de-duplication, as well as the deleted list-15 15.

Plat: C-C++ | Size: 9KB | Downloads: 0

Description: 7-4 Joseph rings (25 points)
N individuals are numbered in a circle order, and the number is reported in the order of 1, 2, 3... from the 1st. The number of the p-announcers withdraws from the circle, while the others start from 1, 2 and 3, and the number of the p-announcers withdraw from the circle, and so on. Please export the original ordinal number of each exit person in the order of exit.
Input format:
Input is only one line, including an integer N (1<=N<=3000) and an integer P (1<=p<=5000).
Output format:
The original serial number of each exit is output in the exit order. The data is separated by a space, but there is no space at the end of the line.
Input example:
A set of inputs is given here. For example:
73
Output example:
3627514

Plat: C-C++ | Size: 9KB | Downloads: 0

Description: 7-2 the establishment and traversal of the sequence table (30 points)
Read the n value and N integers, set up the sequence table and traverse the output.
Input format:
Read N and N integers.
Output format:
Output n integers separated by spaces (there is no space after the last number).
Input example:
A set of inputs is given here. For example:
Four
-3 102078
Output example:
The corresponding output is given here. For example:
-3 102078

Plat: C-C++ | Size: 9KB | Downloads: 1

Description: Algorithm design and data structure

Plat: C-C++ | Size: 248KB | Downloads: 5

Description: Data structure problems such as parking lot management, Cerf algorithm, etc.

Plat: C-C++ | Size: 746KB | Downloads: 0

Description: Implementation of greedy algorithm allocation for n jobs on m machines

Plat: C-C++ | Size: 310KB | Downloads: 0

Description: Learning data structure essential books, PDF version, direct reading

Plat: Delphi | Size: 7798KB | Downloads: 0

Description: A spanning tree of a connected graph with n nodes is a minimal connected subgraph of the original graph, which contains all the N nodes in the original graph and has the least edges to keep the graph connected.

Plat: C-C++ | Size: 194KB | Downloads: 0

Description: The key of KMP algorithm is to use the information after matching failure to minimize the number of matches between pattern string and main string in order to achieve fast matching.

Plat: C-C++ | Size: 176KB | Downloads: 0

Description: Q: How do I build the executable file?
A: If you are going to compile this code in the APP of Dec-C++, find the tool bar, click Execute->compile, the executable file with the same filename will be built. And the shortcut key F9 also will do.
Q: How do I run the executable file?
A: First find the file and open it.
Next, enter a positive integer N, and please no larger than 100, or the program will be quit.
Finally, input N lines. Each line contains two integers which are valued from -1 to N-1 according to a Binary Search Tree already known by you

Plat: C-C++ | Size: 45KB | Downloads: 0

Description: deque, a double-ended queue
A "deque" is a data structure consisting of a list of items, on which the following operations are possible:
* Push(X, D): Insert item X on the front end of deque D.
* Pop(D): Remove the front item from deque D and return it.
* Inject(X, D): Insert item X on the rear end of deque D.
* Eject(D): Remove the rear item from deque D and return it. Write routines to support the deque that takes O(1) time per operation.

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: with command window, input a maze map, where '2' implies wall, '0' for road, 'S' for start, 'E' for end, output a file where '1' implies the right but not only road from start to end.

Plat: C-C++ | Size: 1029KB | Downloads: 0

Description: with command window, input a maze map, where '2' implies wall, '0' for road, 'S' for start, 'E' for end, output a file where '1' implies the right road from start to end.

Plat: C-C++ | Size: 1029KB | Downloads: 0

Description: with linux command window, input a file that describe a maze map, where number 2 implies wall and number 0 implies road , 'S' and 'E' mean start and end

Plat: C-C++ | Size: 1029KB | Downloads: 0

Description: Using linked list as data structure to establish library information management system.

Plat: C-C++ | Size: 214KB | Downloads: 0

Description: Given the frequency sequence of n letters (or words) appearing in the document, X=<x1, X2,... Xn>, get the Huffman encoding of the N letter. For convenience, the following frequency (or weight) W1, W2,... Wn instead.

Plat: C++ | Size: 123KB | Downloads: 0

Description: data structure.C++ programming

Plat: C-C++ | Size: 19785KB | Downloads: 1

Description: A very simple sorting of TOPK values using python, which takes no memory, can handle tens of millions of levels of values and find the largest of the first k values. The file path is passed in as terminal parameters (Timinal: Python sort_top_k.py datafilepath). Notice: The first behavior of a numeric file is k (you want to rank the first few numbers), and then one number per line, integer ,decimal both ok!

Plat: Python | Size: 1KB | Downloads: 0

Description: A very simple sorting of topK values using python, which takes no memory, can handle tens of millions of levels of values and find the largest of the first K values. The file path is passed in the form of terminal parameters (Teminal: Python Sort_top_k.py datafilepath.)Notice: The first line of the file is K (you want to rank the top K numbers), and then one number per line, integer decimal both OK!

Plat: Python | Size: 1KB | Downloads: 0

Description: Several commonly used clustering algorithms, including K-means, LAPGMM, LCGMM, etc.

Plat: matlab | Size: 11KB | Downloads: 1

Description: 07 years Yan Yumin's data structure, textbook source code, C language implementation

Plat: C-C++ | Size: 840KB | Downloads: 0

Description: Data structure employee management system graduation design database

Plat: C-C++ | Size: 434KB | Downloads: 0

Description: tsinghua university press data structure .pdf

Plat: C-C++ | Size: 25520KB | Downloads: 2

Description: Using VC++6. to compile and run simple linear list program is really very simple.

Plat: C-C++ | Size: 1KB | Downloads: 0

Description: Compile and run simple linked list program with VC++6.

Plat: C-C++ | Size: 1KB | Downloads: 0