-
竖井开挖啊
基于flac3d 5.0隧道开挖所使用的循环命令(Cyclic commands used in tunnel excavation based on FLAC3D 5.0)
- 2020-06-21 13:40:01下载
- 积分：1
-
这些文件实现对图像纹理分割
these files inplement to segmentation for image and texture
- 2022-08-14 01:27:57下载
- 积分：1
-
方括号做的程序，用户可以输入括号，以及是否可以使用。
用C做的括号匹配程序,可以检测用户输入的括号是否匹配并给出提示-C matching brackets do procedures, the user can input the brackets and whether the match is suggested
- 2023-01-21 12:30:03下载
- 积分：1
-
POJ1635.tar
POJ 1635，树的同构，哈希方法实现(POJ 1635, tree isomorphism, hash method)
- 2012-11-07 19:30:26下载
- 积分：1
-
一个用vc写的贸易公司管理系统
一个用vc写的贸易公司管理系统-vc write with a trading company in a management system
- 2022-03-22 22:29:04下载
- 积分：1
-
实现md5文件电子签名，md5hash值计算，比较文件，自己可扩展功能实现几个文件对比，从而找出重复文件...
实现md5文件电子签名，md5hash值计算，比较文件，自己可扩展功能实现几个文件对比，从而找出重复文件-Md5 files to achieve electronic signature, md5hash calculated to compare documents, they can extend the functionality to achieve a number of document comparison, and to find duplicate files
- 2022-02-02 15:59:33下载
- 积分：1
-
免费的Delphi控件，可以替代BDE，直接访问.dbf数据库
免费的Delphi控件，可以替代BDE，直接访问.dbf数据库-Free Delphi ActiveX component,replace BDE and direct access .dbf database
- 2022-02-28 19:39:01下载
- 积分：1
-
以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。...
以高效率的方法查找一个数组中的第二大数，数组中的数可以相同.同时对各种可能发生的错误返回相应得错误代码。-find second max number in a high effective method.The number in the array could be the same.meanwhile ,the program return special error code
- 2022-04-24 01:45:15下载
- 积分：1
-
数据结构
数据结构-递归实验-data structure- recursive experiment
- 2022-02-06 03:01:04下载
- 积分：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
