-
里面包含了一个用VC开发的二分法程序,牛顿迭代法程序源码
里面包含了一个用VC开发的二分法程序,牛顿迭代法程序源码-Which contains a dichotomy with VC development procedures, Newton iteration procedure source
- 2023-06-11 07:10:03下载
- 积分:1
-
VB写的非线性回归源
VB写的非线性回归源程序-VB write nonlinear regression source
- 2022-02-05 16:52:24下载
- 积分:1
-
辛普森 COMPUETO
辛普森 COMPUETO
- 2022-05-29 07:24:59下载
- 积分:1
-
汉诺(hanoi)问题采用递归算法解决,并编制了手动及演示界面
汉诺(hanoi)问题采用递归算法解决,并编制了手动及演示界面-Hanne (Hanoi) problem using recursive algorithm, and prepared a manual and demonstrate interface
- 2022-04-30 08:13:55下载
- 积分:1
-
C语言作的四色验证1.需求分析问题描述:证明了可以用不多于4种颜色对n个区域着色,而满足相邻的区域具有不同的颜色输入形式 : 暂定最多50个区域,如需证明更多区...
C语言作的四色验证1.需求分析问题描述:证明了可以用不多于4种颜色对n个区域着色,而满足相邻的区域具有不同的颜色输入形式 : 暂定最多50个区域,如需证明更多区域,修改#define S 50 即可;以整形形式输入(取值范围1-32767)用户需要证明的区域数目,相联的一对矩阵; 输出形式:以0和1输出关联矩阵,和以blue yellow orange pink形式输出每个区域相对应证明出的颜色;-C language does four colors confirm 1. demands analyses
question description: Had proven may use not to be many to 4 kind of
colors to n region coloration, but satisfies the neighboring region to
have the different color input form: Establishes provisionally more
than 50 regions, if must prove more regions, revise#define S 50 then;
Region number (value scope 1-32767) the user needs to prove which by
the reshaping form input, unites a pair of matrix; Output form: By 0
and 1 output incidence matrixs, with form outputs the color by blue
yellow orange the pink which each region corresponds proves;
- 2022-10-20 02:35:04下载
- 积分:1
-
目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子,你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确,如果盘子...
目的是把左边的所有盘子移到右边的杆子上。一次只能移动一个盘子,你可以使用中间的杆子作为临时存放盘子的地方。小盘子必须放在大盘子之上。问题看似不难。的确,如果盘子只有两三个,是很容易解决的。但是随着盘子数目的增加,问题就变得非常难解了。
-purpose is to the left of all the dishes moved to the right side of the pole. Only a mobile one tray, you can use the middle of the pole plate as a temporary storage place. Small plates must be placed on the platter on top. It may seem it is not difficult. Indeed, if the plate is only 23, it"s very easy to solve. But with the increase in the number of dishes, the problem has become a very difficult.
- 2022-01-31 01:19:13下载
- 积分:1
-
Shortest Path
资源描述Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one minimum path from v to w, a path with the fewest number of edges is chosen. It is guaranteed that all the weights are positive and such a path is unique for any vertex.
- 2022-08-26 06:49:00下载
- 积分:1
-
路径查找代码[vb版本代码]
路径查找代码[vb版本代码]-path search code [vb code version]
- 2022-01-26 03:39:11下载
- 积分:1
-
指纹识别
指纹识别,图像处理,计算调色板和其前面的东西的总长度,创建一个用于操作的矩形区域类的对象,位图形式显示灰度数据,匹配过程显示
- 2022-03-19 22:09:39下载
- 积分:1
-
精通Matlab综合辅导与指南
精通Matlab综合辅导与指南-proficient Matlab comprehensive counseling and guidance
- 2022-01-21 05:41:20下载
- 积分:1