-
本程序是一个宾馆程控电话系统,调试成功。对于初学vc的mfc变成有用,主要是与数据库的调用方面。...
本程序是一个宾馆程控电话系统,调试成功。对于初学vc的mfc变成有用,主要是与数据库的调用方面。-This procedure is a hotel program-controlled telephone system, debugging success. Mfc in vc for the beginner into a useful, mainly with regard to the database call.
- 2022-03-16 06:46:13下载
- 积分:1
-
数据结构课程设计题,用C++语言实现二叉排序数,并对二叉排序数进行,插入,删除,修改等操作...
数据结构课程设计题,用C++语言实现二叉排序数,并对二叉排序数进行,插入,删除,修改等操作-insert delete change
- 2022-03-20 11:35:58下载
- 积分:1
-
数据结构与算法综合资料库.CHM
包含经典的数据结构、常用算法、以及c++学习资料等,全是经典的东西...
数据结构与算法综合资料库.CHM
包含经典的数据结构、常用算法、以及c++学习资料等,全是经典的东西-General data structures and algorithms library. CHM contains classic data structure, commonly used algorithms, as well as the c++ learning materials and so on, all things classic. . .
- 2023-05-06 06:00:03下载
- 积分:1
-
用C语言编写的贪吃蛇游戏,运行是按任意键开始,不过呢,反向也算输哟!...
用C语言编写的贪吃蛇游戏,运行是按任意键开始,不过呢,反向也算输哟!-Using C language game of Snake, run is started by pressing any key, however, the reverse also count yo loser!
- 2022-02-13 15:11:40下载
- 积分:1
-
本文介绍了数据结构中的选择排序,希尔排序等算法,采用全英文版,真实可靠...
本文介绍了数据结构中的选择排序,希尔排序等算法,采用全英文版,真实可靠-This paper introduces the data structure of choice, in order of ranking algorithms such as Hill, was used in English, true and reliable
- 2022-02-25 02:55:34下载
- 积分:1
-
简单的搜索引擎
它是基本的 C 编程概念和文件处理中的应用。
使用此应用程序用户可以搜索各种文件在系统内。打开该文件。读它。计算总的行在它和许多这类功能。
- 2022-12-06 06:10:03下载
- 积分:1
-
工资管理系统
在一家公司,工资是所有财务记录的......一名雇员的薪金,以及系统和软件处理薪金所需的费用的总和
- 2023-01-20 07:50:03下载
- 积分:1
-
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
迷宫算法(maze)
/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
*/
-/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
- 2022-08-08 06:28:42下载
- 积分:1
-
队列解决杨辉三角
队列解决杨辉三角-Queue solve Pascal"s Triangle
- 2023-08-20 09:30:03下载
- 积分:1
-
Informix SQL教程指南 V9.4,Informix中如何使用SQL
Informix SQL教程指南 V9.4,Informix中如何使用SQL-Informix SQL Tutorial Guide V9.4, Informix in how to use SQL
- 2022-01-26 04:46:29下载
- 积分:1