-
后的二叉树算法(递归)
二叉树的后序算法(递归)-after the sequence of binary tree algorithm (recursive)
- 2022-09-15 21:25:03下载
- 积分:1
-
在模式识别中,尤其需要对一些样本进行分类,聚类分析是常用的方法,本程序基于最小最大距离的聚类原则实现对样本的聚类...
在模式识别中,尤其需要对一些样本进行分类,聚类分析是常用的方法,本程序基于最小最大距离的聚类原则实现对样本的聚类-At pattern recognition, in particular a number of samples required for classification, clustering analysis is a commonly used method, the procedure based on the smallest maximum distance of the cluster principle implementation on sample clustering
- 2023-02-23 19:00:03下载
- 积分:1
-
正整数x 的约数是能整除x 的正整数。正整数x 的约数个数记为div(x)。例如,1,2,5,10 都是正整数10 的约数,且div(10)=4。设a 和b 是...
正整数x 的约数是能整除x 的正整数。正整数x 的约数个数记为div(x)。例如,1,2,5,10 都是正整数10 的约数,且div(10)=4。设a 和b 是2 个正整数,a≤b,找出a 和b之间约数个数最多的数x。
对于给定的2 个正整数a≤b,编程计算a 和b 之间约数个数最多的数。
数据输入
输入数据由文件名为input.txt的文本文件提供。文件的第1 行有2 个正整数a和b。
结果输出
程序运行结束时,若找到的a 和b 之间约数个数最多的数是x,将div(x)输出到文件output.txt中。
输入文件示例 输出文件示例
input.txt output.txt
1 36 9
-Positive integer x can be about a few of the positive integer x divisible. Positive integer x the approximate number recorded as the number of div (x). For example, 1,2,5,10 are about 10 positive integer number, and div (10) = 4. Set a and b are two positive integers, a ≤ b, to find a and b between about a few number of the largest number of x. For a given two positive integers a ≤ b, Programming calculated a and b between about a few number of the largest number. Data entry input data from the document text file named input.txt provide. File line 1 has two positive integers a and b. The results run the end of the output, if found between a and b of about a few number o
- 2023-04-13 05:20:03下载
- 积分:1
-
牛顿下山法,比较好用!
牛顿下山法,比较好用!-Newton downhill, better quality!
- 2022-02-24 09:26:51下载
- 积分:1
-
用蒙特卡洛方法,求解出y=cos(x)/x在给定区间上的定积分值。
用蒙特卡洛方法,求解出y=cos(x)/x在给定区间上的定积分值。-By Monte Carlo method, the y = cos (x)/x in a given interval on the value of the definite integral.
- 2023-08-19 04:35:03下载
- 积分:1
-
Using NLJ random search method to identify a method that the state of the nonlin...
采用NLJ随机搜索的方法辨识一个以状态方法表示的非线性系统。选其初值 a1(0) =50 , a2(0) =100 , a3(0) =100 , a4(0) =50 , a5(0) =10 , 选范围为 r(1)(i)=0.5 a(0)(i) , 取数据长度 L =40, t =0.005 , 性能指标 J= 。迭代计算结果得 a 的估计值 1=17.6043243, 1=17.5977, 2=72.9573, 3=51.3014, 4=22.9889, 5=5.99965, J = 0.000000916 。-Using NLJ random search method to identify a method that the state of the nonlinear system. Election of its initial value a1 (0) = 50, a2 (0) = 100, a3 (0) = 100, a4 (0) = 50, a5 (0) = 10, choose the range of r (1) (i) = 0.5 a (0) (i), check data length L = 40, t = 0.005, performance index J =. Iterative calculation results have a estimated value of 1 = 17.6043243, 1 = 17.5977, 2 = 72.9573, 3 = 51.3014, 4 = 22.9889, 5 = 5.99965, J = 0.000000916.
- 2022-02-01 23:07:23下载
- 积分:1
-
序列模式挖掘算法prefixspan
数据挖掘领域中的序列模式挖掘,基于时序特性对数据进行挖掘,得到具有时序特性的关联规则,现有的算法有很多,如AprioriAll和freespan算法等等,但是由韩家炜教授提出的prefixspan算法是较为优秀的序列模式挖掘算法,运行速度快,存储空间小,是很不错的高效算法。
- 2022-07-01 09:20:17下载
- 积分:1
-
immune algorithm 求解 tsp问题 python
immune algorithm 求解 tsp问题 python
- 2022-10-10 05:55:03下载
- 积分:1
-
打开携带的数学库的源代码
Open Watcom Math Library Source Code
- 2022-02-05 08:35:36下载
- 积分:1
-
a load Ezwin the fee
一个加载Ezwin的费式序列的动态演示-a load Ezwin the fee-demonstration of the dynamic sequence! !
- 2022-01-25 22:33:20下载
- 积分:1