搜索资源列表
Tug og war.rar
- Tug of War A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than
accept
- 数字运算，判断一个数是否接近素数 A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in
acjanchan
- 2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1. Print 2^?
MaxST
- 图论：最大支撑树算法实现 GraphM.h GraphOpr.h MaxST.cpp MaxST.dsp MaxST.dsw MaxST.h MaxST.ncb MaxST.opt MaxST.plg MaxST.sln MaxST.vcproj sample.gph-graph theory : the largest Spanning Tree Algorithm GraphM.h GraphOpr.h MaxST.cpp MaxS T.dsp
ShortPth
- 图论：最短路径算法实现 Graph.gph GraphBFS.h GraphM.h GraphOpr.h Queue.h sample.gph ShortPth.cpp ShortPth.dsp ShortPth.dsw ShortPth.ncb ShortPth.opt ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Gra
Btree_library
- 数据结构课程源码，b树的示例代码。老师的示范程序-source data structure courses, b tree sample code. The model for teachers
Sort_Demo
- *一个简单的能够形象演示各种排序算法的applet小程序 *类似于Sun公司的示例程序，但比它复杂 *因为这个程序支持简单选择排序，冒泡排序，双向冒泡， *快速排序，希尔排序，堆排序,归并排序共七种排序算法 *每次80个整数随机生成，七种算法同时运行，之间的对比非常明显-* a simple image can be demonstrated by various sort algorithm small applet procedures similar to the
SegmentTree
- 线段树的样例程序，线段树大家都知道吧？类似于算法导论上的区间树，比AVL好实现多了-segment of the sample program for the tree, the tree line you know? Introduction to the algorithm similar to the interval on the tree, to achieve better than AVL more
stones6ok
- Problem F:汽车加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Descr iption 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。 编程任务： 对于给定的n和k(k <= 10000)个加油站位置，编程
Sample
- 用COBOL语言基于IBM大型机实现的一系列样例程序。
1059
- Descr iption Calculate a+b Input Two integer a,b (0<=a,b<=101000) Output Output a + b Sample Input 5 7 Sample Output 12
1058
- Descr iption 为了宣传本次“网宿科技杯”厦门大学第五届程序设计竞赛，系里面做了两张精美的海报。经过了精确的计算，为了达到最佳美观效果，每张海报都有自己最佳的粘贴位置。但是现在问题是，如果两张海报都要求贴在最佳位置时，很有可能有部分地方会重叠在一起。现在您来判断一下这两张海报是否重叠。 Input 输入包含两行，每一行有四个整数来描述这个海报的最佳粘贴位置，X,Y,W,H(-10000<= X,Y <= 10000)(0 < W,
用动态规划算法思想求最小编辑距离
- 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题,Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
Datastruct_C 实现顺序表的就地逆置
- Descr iption 试写一算法，实现顺序表的就地逆置，即利用原表的存储空间将线性表（a1,a2,…..an），逆置为（ an,an-1, …….a2,a1）。 Input 输入长度n 接下来是n个数 Output 操作后的序列。 Sample Input 7 2 4 1 7 5 3 6 Sample Output 6 3 5 7 1 4
sharePfisher
- 确定投影方向使得降维以后，样本不但线性可分，而且可分性更好-Determine the projection direction makes dimensionality reduction, sample not only linearly separable, and a better separability
Apple_Set
- Problem A:放苹果 Time Limit:1000MS Memory Limit:65536K Total Submit:1094 Accepted:441 Language: not limited Descr iption 把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。 Input 第一行是测试数据的数目t（0 <= t
shortest_path
- 分别用floyd 和dijkstra算法计算城市间最短路径的简单例子，地图由固定格式的文件输入，参考压缩包中的sample.txt,地图文件名要作为main参数-Floyd were Dijkstra algorithm and the shortest path between cities in the simple example, the map by a fixed format file input, reference compression package sample.txt,
three-sample-of-Data-Structure
- 数据结构，一共有三个文件，多项式相加，二叉树几种操作，数组正负排序-Data structure, a total of three documents, the sum of polynomials, binary tree several operations to sort the array of plus or minus
datastruct_example
- 本人讲授数据结构课程时的所写的示例程序，结构清晰规范，有注释，全部可编译运行，包括如下代码： 长整数：ch0_bigint2.c 顺序表的实现：ch2_stable.c 链表的实现ch2_ltable.c 合并两个有序表：ch2_stable_merge.c 表达式计算：ch3_express.c 队列的链式实现：ch3_lqueue.c 栈的链式实现：ch3_lstack.c 迷宫求解：ch3_maze.c 队列的顺序实现：ch3_squeue.c
sample
- 数据结构考试的样题，对考试很有帮助。里面是BMP文件。-Data structure sample exam questions on the exam very helpful. Inside is a BMP file.