北大ACM1455(Crazy tea party)

10名海盗抢得了窖藏的100块金子，并打算瓜分 这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯 是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包 括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方 案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名 最厉害的海盗又重复上述过程-10 pirates seize a cache of 100 gold, and plan to divide up these spoils of war. This is the democracy of some pirates (of course it was their own unique democracy), their habits are based on the following manner allocation : one of the most powerful pirate proposed distribution plan, and then all the pirates (including the proposal himself) on this program for a vote. If 50% or more of the pirates agreed to this program, this program was adopted and on the allocation of spoils of war. Otherwise, the proposals will be pirates thrown into the sea, and then nominate the most serious piracy repeated this process

数据结构程序设计――哈夫曼编码，希望给同学一些帮助-Data Structure Programming- Huffman coding, the students want to give some help

kruskal算法，数据结构中贪心算法的C语言实现。-Kruskal algorithm, data structure of the greedy algorithm in C language.

堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程-Realize stack code, realize all the features of the stack, PUSH, POP, insertion, destruction, empty and so on, have a debugger, you can clearly see the operation of the process stack

OTL4.0被设计成一个C++模板框架和OTL-适配器的组合。该框架是一个通用的实施OTL流的概念。该OTL-适配器周围的数据库API薄包装和作为类的类型参数传递到模板框架。

自动备份服务器数据到本地机器上.可以自动和手动设置.-automatic data backup server to the local machine. Automatic and manual configuration.

零件切割问题： 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？ 任给一个输入实例，能输出切割所需要的实际高度并能用图形演示切割的过程-cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? As an input for example, will cut output by the needs of the high and can be used graphic demonstration of the cutting proce

北京化工大学2008年暑期集训一次训练的解题报告和核心代码-Beijing University of Chemical Technology in 2008 summer training report of a problem-solving training and core code

单源点最短路径算法 * 本程序用来实现单源点最短路径（E.Dijkstra）算法 * 在Turbo C2.0编译器下编译通过 * 算法过程中 * 每条边的两个顶点和权值由用户输入，格式：1 2 20 * 程序默认源点为第一个顶点 * 算法完成后输出路径长度和路径上的顶点 * 格式为：路径长度：目标顶点

数据结构课程的电子教案，很好，很精彩，为初学者的好帮手。-Electronic data structure course lesson plans, very good, very exciting, a good helper for beginners.