-
jzl
帮助大家了解矩阵的基础知识
(matrix )
- 2009-12-02 22:29:19下载
- 积分：1
-
294976fcm
this is also fuzzy c means clustering for segmentation
- 2013-09-19 17:48:38下载
- 积分：1
-
STEWAR.war
并联机器人源程序，对于研究机器人的朋友很有用(parallel robot source for research robots useful friends)
- 2006-10-20 18:12:49下载
- 积分：1
-
lmsdemo
matlab lms code whaich is used for echo cancellation
- 2009-10-24 14:37:36下载
- 积分：1
-
Michelson-interferometer-simulation
该代码能是针对物理实验光学仿真，实现基于matlab的迈克尔逊干涉仿真。(The code could be for physics experiments optics simulation, matlab-based simulation of a Michelson interferometer.)
- 2014-02-01 13:40:39下载
- 积分：1
-
Matlab-windows
Matlab的窗函数_矩形窗_三角窗_汉明窗_汉宁窗_布莱克曼窗(The window of the Matlab function, rectangle, triangle window, hamming window and hanning window, blackman window)
- 2014-04-01 14:26:02下载
- 积分：1
-
seismic wave
程序实现了均匀介质、分层介质中规则网格声波有限差分的正演模拟。(The program realizes the forward modeling of sound wave propagation in homogeneous medium and layer homogeneous medium using finite difference method with regular grid.)
- 2017-09-16 11:31:41下载
- 积分：1
-
CARD_Performance_analy
CARD algorithm for WLANs
- 2009-03-17 20:11:14下载
- 积分：1
-
signalprocessing
MATLAB的雷达方面的数据处理工具箱。(MATLAB radar data processing toolbox.)
- 2008-08-14 12:18:40下载
- 积分：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
