输入小孩总数n，从第k个小孩开始，循环的步长m。输出：最先输出的是第一个胜利者，其次为第二个，最后为第N个胜利者。...

资源描述

给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小．用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked obtained a law made by cutting the use of the rectangular plate height h minimum. Using recursive and partition Solving this problem

c#  实现的Kalman滤波算法能够很好地得到、观测和测量模型数据，你值得拥有。欢迎大家下载、试用。谢谢大家的支持！

System requirements:--------------------  TMVA has been tested to run on Linux, MAC/OSX and Windows platforms.  Running TMVA requires the availability of ROOT shared libraries with ROOT_VERSION >= 5.14  (type "root-config --version" to see the version installed)来源URL里面有代码的详细资料http://tmva.sourceforge.net/docu/TMVAUsersGuide.pdfUSERguide可以在上面的链接下载 非常有用 TMVA是ROOT工程的一个独立package， 专门用于数据分析和识别ROOT的全部代码可以在下面的链接下载http://root.cern.ch/drupal/   

实现了一个链表的逆转,全部过程在一个链表内完成!-achieve a reversal of a linked list, in the entire process completed within a List!

包含结构体的应用   以及相关文件的配合使用 当然还会用一些算法方面的知识   基于VC  6.0 的开发 想要学习数据结构这方面的知识你会发现这个源码会是一个很好的初步学习   领你入门的

某银行提供10个服务窗口(7个对私服务窗口，3个对公服务窗口)和100个供顾客等待的座位。顾客到达银行时，若有空座位，则到取号机上领取一个号，等待叫号。取号机每次仅允许一位顾客使用，有对公和对私两类号，每位顾客只能选取其中一个。当营业员空闲时，通过叫号选取一位顾客，并为其服务。

A matlab program for  multi-target tracking,The problem of multi-target tracking is comprised of two distinct, but tightly coupled challenges: (i) the naturally discrete problem of data association, i.e. assigning image observations to the appropriate target; (ii) the naturally continuous problem of trajectory estimation, i.e. recovering the trajectories of all targets. To go beyond simple greedy solutions for data association, recent approaches often

一个自己写的列主元高斯消去法，用Matlab实现-Wrote it myself out of a PCA Gaussian elimination, using Matlab realize

对于求解多个矩阵连乘的最好的算法，能最优化的最短时间能求出值-For solving a number of matrix even by the best algorithm that can optimize the shortest time that can derive value