-
A
Execution cmd.rarExecution cmd.rarExecution cmd.rarExecution cmd.rarExecution cmd.rarExecution cmd.rar
- 2013-12-12 22:11:11下载
- 积分:1
-
Graph-algorithm
图论算法及其对应的matlab源代码,可以当做练习教材使用,其中主要包含了网络最大流等(Graph algorithm and its corresponding Matlab source code, can be used as practice materials to use, which contains a maximum flow in networks)
- 2012-06-02 10:37:54下载
- 积分:1
-
matlab-command
matlab命令,方便初级使用者查询命令(matlab command to facilitate the initial user query command)
- 2011-06-20 16:43:42下载
- 积分:1
-
SIMULINK-simulation
MATLAB语言精要及动态仿真工具SIMULINK(Essentials of MATLAB language and SIMULINK dynamic simulation tool)
- 2011-05-23 15:12:31下载
- 积分:1
-
2D_Heat_Conduction
Matlab code soving 2D heat conduction using FEA
- 2013-03-04 09:14:56下载
- 积分:1
-
CCP-OFDM_noguP
CP-OFDM的MATLAB源代码,简洁明了,非常适合初学入门者(CP-OFDM MATLAB source code, concise, very suitable for beginners beginners)
- 2012-08-23 21:33:08下载
- 积分:1
-
plant
地球公转自转Revolution of the earth rotation(Revolution of the earth rotation)
- 2014-10-24 16:22:34下载
- 积分:1
-
Xu-White-model
用C++编写的xu-white模型,适合砂泥岩地层岩石物理建模,很实用(Written by C++ xu-white model, suitable for sand-shale formation rock physics modeling, it is practical)
- 2020-12-25 09:59:04下载
- 积分:1
-
matlab-guide-to-finite-element
国外计算机经典教材,MATLAB有限元分析与应用。该书为中译本,详尽介绍了有限元分析的各种方法。(MATLAB guide to finite elements.)
- 2013-12-24 00:07:01下载
- 积分: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