-
ninteger
沙发大神啥都分数艾弗森沙发爱上艾弗森沙发沙发沙发(dsgsdgsdgr rg g wegsdgsgrw wer werew we)
- 2017-06-26 15:15:21下载
- 积分：1
-
utd
文章有utd对爬行波进行循迹 给出微分几何算法 可在matlab 及vc来开发(Utd article has crawling wave of differential geometry tracking algorithm is given in the matlab and vc to develop)
- 2008-07-07 16:40:00下载
- 积分：1
-
MATLAB-and-VCPP
一种matlab与VC++混合编程的方法。供初学者参考学习。可以与MATLAB通讯。(One kind of matlab and VC++ mixed programming method. Reference for beginners to learn. You can communicate with MATLAB.)
- 2011-11-02 11:24:14下载
- 积分：1
-
OLS_Algorithm
说明： 虹膜识别模式识别算法，MATlab程序编制，可采用软件自动转换(Pattern recognition algorithms)
- 2011-04-07 16:38:12下载
- 积分：1
-
Applications
说明： DEKTEC信号发生卡的控制软件,dos下面的控制台程序(example source code of DEKTEC player card)
- 2011-02-21 22:20:29下载
- 积分：1
-
ctl_progress
HERE is a smapmpke of my code
- 2013-12-02 15:10:33下载
- 积分：1
-
vb
是matlab中对bp理论的源代码 通过此代码 只需输入原始数据 通过计算可以得到 预期的输出结论(the cold for matlab)
- 2013-12-19 19:28:44下载
- 积分：1
-
VisualCMatlabmix
Visual+C++与Matlab混合编程的研究与实现(Visual+ C++ and Matlab Research and Implementation of Hybrid Programming)
- 2009-10-10 12:47:47下载
- 积分：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
-
0307
此源代码是基于COM和ADO的数据库编程，用到了VC++6.0和ACCE(This source code is based on COM and ADO database programming, using the VC++ 6.0 and ACCE)
- 2008-03-07 12:26:19下载
- 积分：1
