-
2220005mcma0
2005MCMA题程序源码，本程序源码码是自己编的，如有不足请见谅
(2005MCMA title of the program source code, the program' s source code is compiled, if insufficient please forgive me)
- 2012-08-16 06:30:23下载
- 积分：1
-
high-frequency-
高频段超方向性天线阵列设计 (Ultra high frequency band directional antenna array design)
- 2013-11-24 18:21:00下载
- 积分：1
-
College_Staff_Telephone_Book
It is use to maintain the telephone book of college staff...
- 2010-02-20 00:58:00下载
- 积分：1
-
Nativeappdemo
native application的一个demo,可以象chkdsk那样运行(native application of a demo, can occur as did running)
- 2007-02-01 13:22:43下载
- 积分：1
-
Plotting_Tutorial_New1
Plot tutorial is using to calculate in Histogram Matlab
- 2013-12-08 13:27:43下载
- 积分：1
-
The-back-forward-sweep-distribution
配电网辐射状前推回代潮流计算程序，节点可以任意更改。(Forward and backward substitution flow calculation)
- 2013-06-05 11:05:53下载
- 积分：1
-
QRcode
QRcode标准，非常不错的学习和编码资源，有需要的朋友请下载。(QRcode standard)
- 2015-01-09 11:25:04下载
- 积分：1
-
ObjectArxswgl
本实例为VS2005编写的ARX事务管理实例，特别是AcTransaction::getObject()和close()的使用方法，作了正确演示。(ARX transaction management example this example is written in VS2005, especially in AcTransaction:: getObject () and close () method of use, make the correct demonstration.)
- 2014-11-24 22:31:34下载
- 积分：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
-
fastica1
很清晰的fastica算法,主要是有关主元分析的程序，很好的，自己编的，有不会的 可以咨询(it s a progress which is fastica)
- 2013-09-13 23:41:08下载
- 积分：1
