一个简单的用户认证系统，用vfp写的 是我们的一个作业

数据结构链表-多项式-data structure Chain-polynomial

你好，它如此使用...... #include < iostream > #include < stdlib.h >...甚及更多 #include < stdlib.h >...甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >...甚 & 更多#include < stdlib.h >......甚 & 更多#include < stdlib.h >......甚及更多#include < stdlib.h >...甚及更多#include < stdlib.h >......甚及更多#include < stdlib.h >...甚及更多#include < stdlib.h >......甚 & 更多

pb 源码 进度条程序-progress of the process

电梯模拟 的 Visual C++ 的代码-elevator simulation Visual C code

一个作的很好的dao数据库开发，值得一看。-one for the good dao database development overseas.

项目管理中,按科目交叉取数报表按科目交叉取数报表-Project management, cross-check the number of subjects according to statements by the subjects cross-check the number of statements

一个VB写的UDP协议的C/S模式的服务程序-a VB UDP written in C/S mode service procedures

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

这是一个决策树算法-This is a Decision Tree Algorithm

hanoi