-
8皇后问题的递归求解，c语言实现
8皇后问题的递归求解，c语言实现-8 Queen of recursive solution, c Language
- 2023-04-04 08:10:04下载
- 积分：1
-
表达式求值，包括栈的读写，创建，释放，可以求借一般四则运算，带括号等...
表达式求值，包括栈的读写，创建，释放，可以求借一般四则运算，带括号等-expression evaluates, including stacks of reading and writing, to create, release and should seek through four general computing, with brackets, etc.
- 2023-05-07 14:05:02下载
- 积分：1
-
用template实现一维数组的数据结构。
用template实现一维数组的数据结构。-Template used to achieve one-dimensional array data structure.
- 2023-04-08 04:00:04下载
- 积分：1
-
Algorithm: Huarong issues heuristic search.
算法：华容道问题的启发式搜索。寻求一种最优解的快速算法。-Algorithm: Huarong issues heuristic search.
- 2022-10-28 03:55:03下载
- 积分：1
-
使用vc进行数据库编程的好例子，很有参考价值
使用vc进行数据库编程的好例子，很有参考价值-use database programming vc good example of great reference value
- 2022-03-10 15:25:21下载
- 积分：1
-
对于小型图书销售书店而言此软件具有图书销售管理功能，可大大减轻Boss的工作量及帐目清算工作。也对这方面软件开发者有参考价值。...
对于小型图书销售书店而言此软件具有图书销售管理功能，可大大减轻Boss的工作量及帐目清算工作。也对这方面软件开发者有参考价值。-book sales for small bookstores run the software with book sales management functions. Boss can greatly reduce the workload and accounts for liquidation. Also in this area software developers have reference value.
- 2022-11-12 17:25:03下载
- 积分：1
-
MaxtoCode Standard
MaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoMaxtoCode StandardMaxtoCode StandardCode StandardMaxtoCode StandardvvvvvvMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode Standard
- 2022-03-15 08:28:59下载
- 积分：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
-
人事管理系统，软件工程课程设计，TC3下调试成功，采用链表结构，实现增加删除查询等功能，调用汉字库实现汉字输出...
人事管理系统，软件工程课程设计，TC3下调试成功，采用链表结构，实现增加删除查询等功能，调用汉字库实现汉字输出-Personnel Management System, software engineering curriculum design, debug TC3 successfully used Chain structure, the added features such as deleted inquiries, call for Chinese exports Store
- 2023-05-14 08:25:03下载
- 积分：1
-
基于复杂网络的城市温度分析，即基于复杂网络的城市温度分析。
一篇基于复杂网络的城市温度序列分析的英文论文，最后得出了有意义的结论，刊登在MPLB杂志上。希望可以为研究网络及序列相关领域的同行们提供参考。-A english paper about city temperature analysis based on complex network,which is appear in MPLB.
- 2022-01-26 02:15:46下载
- 积分：1
