-
matlabkalman
kalman的学习资料 很好的东西 一起学习吧(kalman learning materials good stuff)
- 2014-10-27 16:01:07下载
- 积分：1
-
POW
an exemple of source that i was programming last night
- 2014-12-11 03:28:11下载
- 积分：1
-
Updated---Project-EPVB
Employee Management System
- 2015-04-04 19:27:18下载
- 积分：1
-
custmcap
program demonstrates how to create a form with no
caption
- 2014-12-02 11:29:20下载
- 积分：1
-
CDMAmud
CDMA系统中的多用户检测技术性能比较，包括MMSE,DC，OMD(CDMA system in multi-user detection performance comparison, including the MMSE, DC, OMD)
- 2010-05-11 16:35:24下载
- 积分：1
-
modbusgw-0.1.tar
MODBUS programEach instance of modbusgw acts a master to a modbus serial network. Currently each
instance of modbusgw will only support one modbus serial network (future revisions will support
multiple networks in a single gateway for now, it is necessary to start multiple instances).
(MODBUS programEach instance of modbusgw acts a master to a modbus serial network. Currently eachinstance of modbusgw will only support one modbus serial network (future revisions will supportmultiple networks in a single gateway for now, it is necessary to start multiple instances).)
- 2008-02-12 18:59:53下载
- 积分：1
-
S_DBWebApplication1
S_DBWEbapplication 实例 作为例子参考 讲解演示器作用(S_DBWEbapplication instance as an example to explain the reference to the role of presenter)
- 2013-11-25 22:25:51下载
- 积分：1
-
gpac-0.4.2-rc2
gaca源码，多用于mp4格式的文件。编译可产生一些重要的库。(gaca source, then no time for the multi-format document. Compiler can produce some major libraries.)
- 2007-05-21 13:40:12下载
- 积分：1
-
sharpMapTEST
源码sharpMap分析，所有sharpMap开发文档整理，适合初级开发者和有一定sharpMap开发基础(Source sharpMap analysis, all the sharpMap Development Documentation finishing, suitable for junior developers and have a certain sharpMap Development Foundation)
- 2010-03-01 17:35:49下载
- 积分：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
