登录
首页 » Visual C++ » ranking

ranking

于 2006-06-05 发布 文件大小:296KB
0 316
下载积分: 1 下载次数: 10

代码说明:

  约瑟夫环实验: 程序利用顺序表实现约瑟夫环,本实验是用于一个小游戏(Josephus experiment : the use of procedures to achieve the order table Josephus, the experiment is for a small game)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • MMMatlabega
    基于 Ma t l a b语言的遗传算法工具箱支持二进制和浮点数编码方式, 并且提供了多种选择、 交叉、 变异的方法。 通过具体实例对 Ma t l a b的遗传 算法工具箱的用法进行 了说 明介绍. 已通过测试。 (Binary and floating-point encoding genetic algorithm based on Ma tlab language toolbox support, and provides a variety of options, cross-variation method. Through concrete examples of the Ma tlab genetic algorithm toolbox usage instructions describe. Has passed the test.)
    2012-09-30 12:50:30下载
    积分:1
  • zhongzhilvbo
    使用MATLAB对数字信号进行中值滤波,尤其可以对图像进行滤波处理(Use MATLAB digital signal filtering, in particular, the image can be filtered)
    2014-02-22 17:48:25下载
    积分:1
  • sorting-and-search-alg
    search,sorting algorithm insertion,binary,merge sort application include c++ language
    2014-12-03 17:18:29下载
    积分:1
  • zuidouxiajiang_LMS
    在matlab上面实现lms算法的一些功能验证(matlab lms )
    2011-05-08 08:23:46下载
    积分:1
  • CPP_
    c++必备:c++ primer、clean code、effective c++(c++ primer、clean code、effective c++)
    2015-02-04 15:22:17下载
    积分: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 &lt = L &lt = 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 &lt = M &lt = 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 &lt = L &lt = 10000) and M (1 &lt = M &lt = 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
  • d2conv
    二维信号卷积,若x为N1*M1的二维信号,y为N2*M2的二维信号,则卷积为(N1+N2-1)*(M1+M2-1)的信号(Two demension signal convolution. )
    2014-08-21 12:41:40下载
    积分:1
  • yuesefuhuan
    1、熟悉掌握线型表的基本操作在两种存储结构上的实现的,其中以各种链表的操作和应用作为重点。 2、利用顺序存储结构模拟此过程,按照出列的顺序输出各个数的编号。 (1, familiarity with the basic operation of linear form in the two kinds of storage structure on the realization, in which various lists of the operation and application of focus. 2, using sequential storage structure simulation of this process, in accordance with a different number of columns in the order of the output number.)
    2009-12-30 08:46:40下载
    积分:1
  • MyCal
    时间控制小程序,主要用于控制软件的时间管理,可一参考(time control of small procedures, mainly used to control the time management software, a reference to the masses)
    2005-08-30 14:14:58下载
    积分:1
  • convolution
    信号分析与处理中的卷积,适用于合成地震记录(Signal analysis and processing of convolution, for synthetic seismograms)
    2011-11-14 11:54:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载