create a binary tree using preorder before the establishment of a tree. transmis...

在Android中用java开发是所用的数据库 SQLite-Android java SQLite

企业售后管理系统-enterprise management system sale

本代码包包含有各种各样的常用算法代码,你可以在里面找到你所要的-the code packs containing a wide range of commonly used algorithm code, you can still find what you want

基于ADODC和ACCESS的客户管理程序，可实现客户信息的添加、删除、查询、修改等。-Based on customer management ADODC and ACCESS programs for customer information to add, delete, query, modify and so on.

dfgdsfg sdfg dsfg dfsg dsfg dsfg sdf gsdg sdg sdfg sdgdsfg

采用递归调用的方法打印输出一个非循环图的所有拓扑排序-output all the topological sorts of an acyclic graph

使VC连接数据库变的更简单-VC connect to the database so that a simple change

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

ORACLE数据库得建表语句-ORACLE database built in Table statement

汉诺塔演示程序，用VB做成的图形界面，能够实现汉诺塔问题，也即是把N个盘子从一根棍上移到另一根上面，通过中转的棍，但是必须保证在每根棍上都是下面的盘子大于上面的盘子。-HANOR demo program using VB create graphical interface to HANOR problems, that is, N dishes from one club to another on the above-through the interchange stick, but it must be guaranteed in each stick-on the following dishes are greater than the above dishes.