A simple VC++ programming and database link, you can choose the data source

同样具 体引退台与与与土他 与体引退台与与与同同样具体引退台与与与土他与土他与 土他与 -same with the same specific retire with Taiwan and with the soil and soil his body and he retire with Taiwan and the same with concrete and retire with Taiwan and with the soil and soil samples with specific units and retire with his Turkish soil with soil with soil and he

推箱子状态空间搜索,慢慢研究吧。分支限界法，采用优先队列实现-tuixiangzi

固定资产管理系统-Fixed Assets Management System

算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constraints which each job can be in the same amount of time to complete the job-scheduling problem

1．定义顺序栈的数据结构 2．编写函数实现的栈的初始化、入栈、出栈、判断栈是否为空的算法，并应用与表达式的括号匹配检测。 3．定义队列的链式数据结构 4．编写函数实现链队列的入队列、出队列算法-1. Stack data structure defines the order of 2. Write a function to achieve the initialization of the stack, stack, out of the stack, to determine whether the stack is empty the algorithm, and application and matches the test expression in parentheses. 3. Chain data structure defines queue 4. Write a function to achieve chain of queues into queue, a queue algorithm

数据库使用的各种语法，详细的介绍了数据库的使用-Database used in a variety of grammar and detailed introduction of the use of the database

prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。-prim algorithm using the principle of Minimum Spanning Tree Algorithm prim. Application of organic prim and storage arrays spanning tree.

单纯形法，可以用于进行线性规划解的求取。在数学上有一定的应用价值，但速度上可能不太优化，如果对速度有要求的，可参考MATLAB-Simplex method, linear programming solution can be used to carry out the strike. In mathematics there is a certain value, but the speed may not be optimized for speed if required, can refer to MATLAB

Access数据库经典模板，Access-DateBase-Template.rar-Classic template Access database, Access-DateBase-Template.rar

dd牛的usaco源代码！对学习算法，oi的人很有帮助-dd cattle usaco source code! Of learning algorithm, oi the people very helpful