-
childinline
小孩排队问题，从任选一个小孩开始，出队，任隔几个小孩数数，数到几可以出队(Children queuing problem, choose one child from the beginning, the team, he was counting every few kids, a few to a few can be a team)
- 2010-05-08 23:47:40下载
- 积分：1
-
GA_and_ACO_TSP
使用遗传算法和蚁群算法求解TSP问题，并且
实时地将计算结果和所用时间等信息显示在界面上，很直观。(The use of genetic algorithms and ant colony algorithm for TSP problem, and real-time results and the use of the time information is displayed in the interface is very intuitive.)
- 2010-09-03 21:45:37下载
- 积分：1
-
fiber-HE11-mode
利用matlab模拟光纤中的HE11模的模式分布图。(Using matlab to simulate the HE11 mode fiber mode distribution.)
- 2013-07-30 09:55:11下载
- 积分：1
-
junzhilvbonmd
MATLAB对数字信号进行均值滤波，尤其是对数字图像(MATLAB for digital signals mean filter, especially for digital images)
- 2014-02-22 18:43:06下载
- 积分：1
-
BPANN
基于BP神经网络的字符识别算法源代码，包括网络仅值训练方法，训练是通
过调用34个字符文件夹，识别率达到99.8 。(BP neural network-based character recognition algorithm source code, including the value of the network only training methods, training is by calling the 34-character file folders, the recognition rate of 99.8 .)
- 2015-01-10 22:59:33下载
- 积分：1
-
mqam
Qam modulation effective matlab code
- 2011-09-10 15:46:48下载
- 积分：1
-
matlab
matlab書籍的簡介 張智星 適合剛入門程式語言的人(Zhang Zhi brief introduction matlab book stars)
- 2009-03-26 17:48:02下载
- 积分：1
-
liziqunmatlab
粒子群反演算法，可用于波动反演，地震领域，岩石破裂领域。(Particle swarm inversion algorithm can be used in wave inversion, seismic field, rock fracture field.)
- 2017-06-03 09:56:18下载
- 积分：1
-
ClientLogon
new raja login gm tool
- 2014-01-29 14:12:55下载
- 积分：1
-
2
说明： 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。
现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。
可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。
输入：
两个整数L(1<=L<=10000)和M(1<=M<=100)。
接下来有M组整数，每组有一对数字。
输出：
可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 < = L < = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 < = M < = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 < = L < = 10000) and M (1 < = M < = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
- 2015-03-22 23:35:47下载
- 积分：1
