用VB与ACCESS数据库结合编写的远程数据传输程序

用C++实现二叉树的建立，删除，添加。主要使用的是类的结构。-C realization of the establishment of binary tree, delete, add. The main category is the use of the structure.

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

定时备份Oracle数据库和文件的程序 支持RAR压缩功能-Regularly back up Oracle databases and documents in support of RAR compression

这是关于图论算法里面的一些代码,图论基本的思想代码的实现-This is on the graph theory algorithm inside some code, graph theory, the idea of the basic code realize

根据一段给定的文章构造哈夫曼树并对一段给出的代码译码成为一段文章，输入输出均通过文件来实现，并配有报告文档。-According to the article section of a given structure of the Huffman tree is given a section of the code decoding to become a section of articles, input and output are achieved through the document and the document with the report.

这是李春葆的《数据结构全书》的源码，亲测运行通过，比较适合自学数据结构，好东西当然不能独吞了，好评呦，亲！适合考研的同同学

问题描述： 给定n个石子，其重量分别a1,a2,a3...an,要求将其划分成m份，每一份的划分费 义为这份石了中最大重量与最小重量的差的平方。总划分费用等丁m份划分费用之和。 编程任务 对于给定的n个石子，求一种划分方案，使得总划分费用最小。-Description of the problem: Given n-stones, its weight, respectively a1, a2, a3 ... an, asked that it be divided into m copies, each of the division of costs defined as the weight of the stone of the largest and the smallest weight difference the square. Small m the total costs were divided into the sum of the cost. Programming tasks for a given n-stones, seek a kind of division, making the total cost of the smallest division.

房地产销售管理系统包括销售房屋、楼房信息管理、客户信息管理、员工信息管理、费用管理等功能。我的毕业设计，毕业论文和打包好的毕业程序代码和未打包的程序代码-real estate sales management system including sales of housing, building information management, customer information management, information management staff. cost management, and other functions. I graduated from the design, packaging and good thesis graduate program code and not the packaging code

将两个随机产生的链表连接,并按从小到大的顺序输出-two randomly generated Chain Link, together with a small to large export order

控件datagridSource-Control datagridSource