现有喜串定义如下。a 与b 互为喜串需满足以下两个条件之一： 1. a 和b 相同。 2. 将a 分成a1 与a2 两个等长串，b 分成b1 与b2 两个等长串，其子串需满足以下两个 条件之一： a) a1与b1互为喜串且a2 与b2 互为喜串。 b) a1与b2互为喜串且a2 与b1 互为喜串。 任务： 判断给定的两个串是否互为喜串
Hi existing string defined below. a and b mutually hi string must meet one of the following two conditions: 1. a and b are the same. 2. Place a a1 and a2 into two equal length strings, b b1 and b2 into two equal length strings, which substring must meet one of two conditions: a) a1 and a2 and b1 string hi to each other and b2 mutual hi string. b) a1 and a2 and b2 each other hi string hi string and b1 each other. Task: to determine whether a given two strings string hi to each other (2015-11-17, Visual C++, 1KB, 下载3次)
平衡二叉树生成 输入任意个节点 如 2 6 8 0为显示 可自动生成平衡二叉树 bf为平衡因子 h给深度 可插入删除 计算转动次数
Balanced binary tree to generate arbitrary input nodes as 2680 to show a balanced binary tree can be automatically generated for the balance factor bf depth h to calculate the number of rotations can be inserted deleted (2014-01-15, Visual C++, 3KB, 下载3次)
用栈逆置一个单链表请设计一个算法，利用一个栈，利用一个栈将一个单链表(a1，a2，…，an)(其中n≥0)逆置为(an，an-1，…，a1)
A single linked list with a stack inverse set design an algorithm using a stack using a stack in a single linked list (a1, a2, ..., an) (where n ≥ 0) the inverse set (an, an-1, ..., a1) (2012-12-23, Visual C++, 1KB, 下载1次)
从文件读入30个无序整数，建立一个双向循环链表并输出，调整链表顺序为
（a1,a3.a5…,a2,a4,a6…）并输出。
Read from the document 30 disorderly integer, a bidirectional circular list and output adjustment linked list of the order of (a1, a3.a5 ..., a2, a4, a6 ...) and outputs. (2012-12-16, Visual C++, 1KB, 下载5次)
已知线性表（a1 a2 a3 …an）按顺序存于内存，每个元素都是整数，试设计用最少时间把所有值为负数的元素移到全部正数值元素前边的算法
Order known linear form (a1 a2 a3 ... an) stored in the memory, each element is an integer, with the least time trial design value is negative elements over all positive numerical elements front algorithm (2012-10-21, Visual C++, 287KB, 下载3次)
一元多项式A = anxn + … + a1x + a0, B = bnxn + … + b1x + b0，根据运算符+、-、*，分别计算A + B、A - B、A * B。
A polynomial A = anxn+ ...+ a1x+ a0, B = bnxn+ ...+ b1x+ b0+ operator,-,*, respectively, to calculate the A,+ B, A- B, A* B. (2012-05-20, Visual C++, 1KB, 下载2次)
经典算法：已知树T中结点的前序和中序序列分别放在字符型数组a1，a2中，试编写构造此二叉树的算法。
The classical algorithm: the known tree T node in the preorder and inorder sequence on the character array a1, a2, try to write the constructed binary tree algorithm. (2012-03-25, Visual C++, 2KB, 下载2次)
学生成绩管理系统 数据结构二叉树实现。C++编程语言
the manage of the student s grade. (2012-03-17, Visual C++, 935KB, 下载10次)
给定N（1≤N≤32767）天的营业额a1,a2,a3,……an. 定义最小波动值：该天的最小波动值=min{|该天以前某一天的营业额-该天营业额|}. 特别地，第一天的最小波动值即为a1. 试求N天的最小波动值之和。
Given N (1 ≤ N ≤ 32767) day turnover a1, a2, a3, ... ... an. Defines the minimum volatility value: the smallest fluctuations in the value of the day = min {| one day before the day s turnover- the day turnover |}. in particular, the first day shall be the minimum fluctuations in the value of a1. find the N-day fluctuations in value and the minimum. (2012-01-18, Visual C++, 1KB, 下载2次)
卡耐基网站SSD6课程练习5作业.绝对好用，欢迎大家下载使用
Exercise 5 Carnegie website SSD6 course work. Absolutely easy to use, welcome to download (2011-12-21, Visual C++, 643KB, 下载20次)
设A＝（a1， ……，am）和B＝（b1，……，bn）均为顺序表，A’和B’分别为A和B中除去最大共同前缀后的子表
试写一个比较A，B大小的算法
Set A = (a1,......, am) and B = (b1,......, bn) are all order list, A "and" B for A and B were removed after the son of the most common prefix table
Try to write A more A, B the size of the algorithm
(2011-11-27, Visual C++, 1KB, 下载4次)
给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。
你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。
Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is a mere of, i = 1,2, ..., n-1. Your task is to determine the matrix multiplication operation with the order, the computation of the n matrix product A1A2 ... An even when the multiplication of the total number of elements to a minimum. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the product A1A2A3 even when calculated according to (A1A2) A3 multiplication of the number of elements required to achieve at least for 7500. (2011-10-11, Visual C++, 5KB, 下载2次)
实现字符串的查找功能：BF算法，KMP算法，对上述两个算法进行时间复杂性分析并设计实验程序验证分析结果
Find function for string: BF algorithms, KMP algorithm, the two algorithms of time complexity analysis and experimental design analysis of program verification (2011-01-11, Visual C++, 25KB, 下载16次)
问题描述与实验目的
给定8*8方格棋盘，求棋盘上一只马从一个位置到达另一位置的最短路径长。
注意马是走“日”形的。
输入
输入有若干测试数据。
每组测试数据仅1行，每行上有2个方格pos1、pos2，之间用一个空格隔开，每格方格表示棋盘上的一个位置，该位置由表示列的1个字母（a-h）及表示行的一个数字（1-8）构成，如“d7”表示第4列第7行。
输出
对输入中每行上的2个方格pos1、pos2，输出马从位置pos1跳到pos2所需的最短路径长。如“a1==>a2: 3 moves”表示从位置a1跳到a2所需的最少步数是3。
注意：按输出样例所示格式输出，如“a1==>a2: 3 moves”中冒号后有一个空格，再跟着所需的最少步数。
实验结果
输入样例
a1 a2
a1 a3
a1 h8
g2 b8
输出样例
a1==>a2: 3 moves
a1==>a3: 2 moves
a1==>h8: 6 moves
g2==>b8: 5 moves
Description and purpose of the experiment
8* 8 grid for a given board, find the board a horse from one location to another location to reach the shortest path length.
Note that horse is to take the "day" shape.
Input
Enter a number of test data.
Only 1 line of each test data, each line has 2 squares pos1, pos2, separated by a space, each grid square, said a board position, the position of column 1 by the said letters ( ah), and that the line of a number (1-8) form, such as "d7" said the line 7 column 4.
Output
Each line in the input box on the two pos1, pos2, output horse to jump from position pos1 pos2 shortest path length required. Such as "a1 ==> a2: 3 moves" that jump from position a1 a2 minimum required number of steps is 3.
Note: The sample shown by the output format of the output, such as "a1 ==> a2: 3 moves" in a space after the colon, and then follow the required minimum number of steps.
Experimental results
Input sample
a1 a2
a1 a3
a1 h8
g2 b8
Sample Ou (2010-11-08, Visual C++, 850KB, 下载18次)
利用线性表实现一个一元多项式Polynomial
f(x) = a0 + a1x + a2x2 + a3x3 + … + anxn
The realization of a linear form of Multinomial Polynomial f (x) = a0+ a1x+ a2x2+ a3x3+ ...+ anxn (2010-08-19, Visual C++, 974KB, 下载3次)
给定n个不同元素的一个序列a1,a2,a3,..,an通过重复交换相邻的对，本算法实现他的所有排列，用辅助数组来记录各元素的排列的逆，时间复杂度O（n）
Given the different elements n a sequence a1, a2, a3,.. , an adjacent to repeat through exchange, this algorithm, with all his assistant array to record the inverse elements arrangement, the time complexity O (n), (2010-04-26, Visual C++, 246KB, 下载2次)
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m)
Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) (2009-06-27, Visual C++, 24KB, 下载3次)
字符串匹配算法-BF算法，它是字符串匹配的最简单算法，适合入门时参考。
String matching algorithm-BF algorithm, which is the most simple string matching algorithm, suitable for entry-reference. (2008-06-02, Visual C++, 1KB, 下载40次)
给出一个由非0整数组成的序列a1,a2,…,an, 设计递归算法求其中由同号整数组成的最长连续段(称为最长同号连续段)的长度。
Given a non-0 component of the sequence of integers a1, a2, ..., an, the design of recursive algorithm for one by the same integer number consisting of the longest continuous segment (known as the longest consecutive number with the above) in length. (2008-05-17, Visual C++, 215KB, 下载2次)
设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。
with different denominations a1, a2, ..., an stamps, each up to the letter m stamp affixed. For a given set of m, n, obtained the largest postage continuous interval. (2007-06-12, Visual C++, 403KB, 下载7次)