资源列表
CH19
- c的几个代码，本人珍藏版！！！！！！！！谢谢，请让我加入把-c Several code, I Collector Edition! ! ! ! ! ! ! ! Thank you, please allow me to join the
tidai
- 替代密码体制的编写，基本上实现了替代密码的基本思想，感兴趣的可以试试啊！-The preparation of alternative cryptosystem basically achieved the basic idea of an alternative password, interested can try ah!
pingpangjlb
- 乒乓球俱乐部管理系统，包括会员管理，场地管理，收入管理，时间安排。实现了对数据的添加，删除，修改。-Table tennis club management system, including members of management, venue management, revenue management, schedule. The realization of data add, delete, modify.
double-linked-list
- double link list sample
jsp+access
- 整个系统从符合操作简便、界面友好、灵活、实用、安全的要求出发，完成人事管理的全过程，包括员工档案信息的管理，员工工资信息的管理以及员工的请假记录的管理。经过实际使用证明，本文所设计的人事管理系统可以满足公司人事管理方面的需要。-The entire system from the line with the simple, user-friendly, flexible, practical and safety requirements, the completion of the entir
baffman
- 哈弗曼编码的实现，包括了构造哈弗曼树函数，编码函数，译码函数和输出函数。-哈弗曼coding to achieve, including the structure tree哈弗曼function, encoding function, decoding function and output function.
labyrinth
- 本程序的功能是找出指定迷宫的路径，包括了递归和非递归算法。-This procedure is to find out the designated functions of the labyrinth path, including the recursive and non-recursive algorithm.
change
- 进制转换程序，利用栈算法对输入数进行指定进制的转换。-Hexadecimal conversion process, using the stack algorithm to specify the number of input M-ary conversion.
ysfzz
- c＋＋类函数中的运算符重载，不使用标准函数库，用自定义的运算符实现运算-c -type function overloading operator, do not use the standard function library, using a custom operator to achieve computing
subset
- 子集和问题的一个实例（s，t).其中s是一个正整数集合，t是一个正整数。子集和问题判断是否存在s中的一个子集s1，使得s1的和等于t-And problems in a subset of an instance (s, t). Which is a positive integer s collection, t is a positive integer. Subset and to determine whether problems exist s in a subset of s1,
congshu
- 给定含有n个元素的多重集合s，每个元素在s中出现的次数称为该元素的重数。-Given n elements containing multiple collection s, each element s appearing in the number of elements is called the multiplicity.
shanshuwenti
- 给定n位正整数a，去掉其中任意k<=n个数字后，剩下的数字按原次序排列组成一个新的正整数，设计算法找出剩下的数字组成的新数最小的删数方案-Given n-bit positive integer a, removing one arbitrary k <= n In the figures, the remaining number of the original order to form a new positive integer, design algorithm to id