-
example2
CDMA 语音编码,在MATLAB环境下可直接运行(CDMA speech coding)
- 2009-05-17 17:19:40下载
- 积分:1
-
matlab-json-master
This package contains Matlab class to serialize/decode matlab object in
json format. The software uses org.json java package to convert json to
java object and then translates it into Matlab object.
- 2013-09-28 06:38:56下载
- 积分:1
-
CPP-progaram-example
C++ 学习基础源码程序,帮助初学者快速掌握C++的基本使用及基础的编码技巧(Learn basic c++ source program, to help beginners quickly grasp the basic use of c++ and basic coding techniques)
- 2014-11-28 10:12:00下载
- 积分:1
-
GStreamer
最新的gstreamer内部原理和开发指南,讲的非常详细,收藏好多年啦(The new GStreamer internal principle and development guide, a very detailed, for several years)
- 2014-02-19 20:36:47下载
- 积分:1
-
exp
使用MATLAB程序通过18个循环,求最少费用的问题.(new Cumulative )
- 2013-05-15 23:09:21下载
- 积分:1
-
malloc
ics 的malloc实现,采用分离存储,模拟memory的malloc和free等操作。(to realize the molloc and free operation, the lab of ics class)
- 2014-01-09 10:36:34下载
- 积分:1
-
Visual-CPPand-Matlab
数字图象处理与机器视觉Visual C++与Matlab实现,光盘源代码(Digital image processing and machine vision Visual C++ with Matlab, CD-ROM source code)
- 2013-12-24 12:02:43下载
- 积分:1
-
SHADW
shadow detection paper from net,it is value
- 2013-12-19 19:43: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
-
AdaptiveTechniquesforMultiuserOFDM
这是一个非常好的关于OFDM的英文文章,它是国外的博士论文,对于想了解整个OFDM的朋友来说,可以了解到许多中文文章所没有的知识。(This is a very good article in English on OFDM, which is the doctoral thesis abroad, who want to understand the overall OFDM' s friends, you can understand that many Chinese do not have knowledge of the article.)
- 2010-07-18 11:34:02下载
- 积分:1