一个用vc写的贸易公司管理系统

一个用vc写的贸易公司管理系统-vc write with a trading company in a management system

本文介绍如何使用一些sql操作符

利用克鲁斯卡尔算法求边集数组GE所示图的最小生成树-Order to Kruskal algorithm using an array of GE edge set of minimum spanning tree as shown in Figure

本软件实现对数据进行高级加密,值得一看,不可错过.-the right software for advanced data encryption, an eye-catcher, not to be missed.

Windows和Unix下的Oracle通用C开发库-Windows and Unix Oracle general C development storehouse

输入人数，输入将要分配的工作数目，输入第i人干第j项工作的经费消耗，调用处理模块BackTracking输出最优分配方案。-Enter the number, type of job distribution to the number of people do i enter the first section of the work of j-expendable funds, call processing module output BackTracking optimal distribution program.

本书总结了历届国际奥林匹克竞赛（IOI）的试题特点及我国参赛选手的培训经验。书中许多例题取自历届大赛的试题及中国队选手的训练题目，针对问题讲解了解题的关键思路及如何灵活运用有关的算法知识。-the book summarizes the successive international Olympiad (IOI) and the characteristics of the questions my players training experience. Many examples from the book the previous contest questions and the Chinese team"s training topics dealing with the problem of solving the problems on the key ideas and how flexible use of the algorithm knowledge.

数据算法，凉东问题-data algorithm, the cooler East problem

unix上的ODBC实现-unix on ODBC to achieve

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)