欢迎使用是用Visual FoxPro 7.0数据库开发典型实例

程序存储问题:设有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

解决约瑟夫问题，运行过了，保证可以。问题是清华严蔚敏版本的《数据结构》书-Joseph problems to solve, run-off, and guarantee. The problem is Tsinghua Yan Wei-min version of the " Data Structure" book

基于语义本体的单词查询系统-Semantic Ontology word Inquiry System

给定一个n位正整数a，去掉其中任意k

小型数据库源代码较多，请耐心审阅勿用于商业交易，一经发现后果自负-small database source code more, not patience scrutiny for commercial transactions, the one found responsible for any consequences! !

像小卡片一样的日历,包括星期-like small cards the same calendar, including the week

VB6.0下对Access数据库文件进行查找、添加、删除记录的源代码！-VB6.0 under the Access database files to search, add, delete records of the source code!

我自己编写的一个C++ kruskal最小生成树程序，希望可以对初学者有所帮助，错误难以避免，希望大家谅解 -I have written a C++ Kruskal minimum spanning tree procedure, hoping to be helpful for beginners, it is difficult to avoid errors, I hope everyone understanding

SQLite的封装类，简单实用，支持常用操作！ 自己感觉封装的不错，运行平台有：windows、linux、unix。 如果有什么问题和建议，请邮件yin0123@sina.com

64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation