-
2
说明: 跟踪法导引法的MATLAB,程序,希望大家多侃侃(matlab)
- 2009-08-12 14:26:02下载
- 积分:1
-
LAGchazhi
用于实现拉格朗日差值算法,可用于GPS星历计算(For the Lagrange interpolation algorithm, can be used for GPS ephemeris
)
- 2014-08-14 17:06:42下载
- 积分:1
-
AT89S51_Voltage_Measure
8089s52 based degital voltmeter. usefull project with full report
- 2012-09-02 02:52:52下载
- 积分:1
-
deadbeatcontrol
仿真为单相并网逆变器的仿真模型,使用matlab进行搭建,使用无差拍控制的方法,希望进行探讨(Simulation of single-phase grid-connected inverter simulation model using matlab to build, using deadbeat control, and I hope to explore)
- 2015-12-05 10:35:29下载
- 积分:1
-
C_eig
利用幂法和反幂法求解按模最小特征值,按模最大特征值。与MATLAB中eig功能相似 (get the character value of a matrix, similiar with the function eig in matlab)
- 2013-12-02 11:04:25下载
- 积分:1
-
vcPP--renshutongji
人数统计 vc++ 因为 本人需要matlab的人数统计源程序代码 所有先上传自己有的vc++源代码来让大家参考(Number of vc++ because I need matlab source code for all the statistics the number of first upload your own and some vc++ source code to make your reference)
- 2011-04-21 09:34:23下载
- 积分:1
-
initpop
几个matlab小程序,主要用于遗传算法仿真(Several small matlab program, mainly for genetic algorithm simulation)
- 2010-09-05 00:15:51下载
- 积分:1
-
viterbi-3.0.1
This file contains a C++ based source code for an optimized Viterbi decoder.
- 2014-11-24 17:42:30下载
- 积分:1
-
Enumprocess
Enumprocess (window kernel)
- 2014-10-23 13:36:51下载
- 积分: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