Delphi编程练习：在数据库中以文件流形式保存JPEG图片。

在 Visual Basic 6.0 开发项目。它是一个快递管理系统来管理和跟踪快递。欢迎大家下载、试用。谢谢大家的支持！

.Net显示了友好的人机界面，以及非常少量的原代码就能够完成所要的功能-. Net shows the friendly human-machine interface, as well as a very small amount of the original code to be able to complete the function of

本文章首先简要介绍了一维与二维情况下的最接近点对问题与所涉及到的解决算法.然后,把最接近点对问题延伸至三维,提出了自己的解决思想,并提供了相关伪代码,以供参考.请各位朋友多提建议!-err

duiwenjiandechuli fangbianguanli.

Josephu问题,一元多项式的相加问题,模拟停车场管理问题等问题-Josephu problem, a polynomial of the sum of the problem, simulated car park management and other problems

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

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

十分全的数据结构VC++源代码,是学习算法,设计,编程的必备资料,很实用的!-The data structure is very full VC++ source code, is a learning algorithm, design, programming of the necessary information, it is useful!

Matlab入门篇介绍了一些基本的Matlab语句。并且有丰富的实例。-chapter introduces some basic Matlab statement. And there are abundant examples.

树的操作中的邻接表。。解压即可。。直接上交-Tree adjacent to the operation table. . Can extract. . Directly handed over to