Blowfish加密

VC++编写的通讯录实例，实现简单数据库功能 （不用后台数据库支持）-VC prepared directories example, to achieve a simple database function (no background database support)

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20

网上自动答疑系统(C#) -automatic online Advanced Systems (C#)

数据结构 详细描述了如何创建单循坏链表的方法以及操作-Data structure described in detail how to create a single through the bad list of methods and operations

一个c语言开发的小型的dbms系统，支持造表查询，删除等一些简单的操作-a small development of DBMS systems to support table made inquiries, delete some simple operation

书籍管理系统，SQL数据库课程设计，用C实现与SQL数据库连接实现书籍增加删除查询等功能模块，采用分模块法，论文与代码齐全，-book management system, SQL database curriculum design, realization of C and SQL database connectivity to achieve books increased inquiries delete function module, a sub-module, papers and complete code,

各种数据整合,使用与各种数据库的整合，，各种数据整合-A variety of data integration, use and integration of various databases, a variety of data integration

数据结构算法演示-demonstration algorithm data structure

创建一个链表，逆向输出链表，两个链表的合并的vc程序编程实现代码。-create a linked list, reverse output chain and the two combined Chain vc programming code to achieve.

深度优先搜索求迷宫问题 采用深度优先搜索的方法求解迷宫问题，方便快捷-Depth-first search order to the maze problem using depth-first search method for solving a maze problem, convenient and quick