Josephus+Problem技术资料下载专区，收录240份相关技术文档、开发源码、电路图纸等优质工程师资源，全部免费下载。
Josephus 排列问题定义如下：假设n 个竞赛者排成一个环形。给定一个正整数m，从某 个指定的第1 个人开始，沿环计数，每遇到第m 个人就让其出列，且计数继续进行下去。这 个过程一直进行到所有的人都出列为止。最后出列者为优胜者。每个...
fastDNAml is an attempt to solve the same problem as DNAML, but to do so faster and using less memory, so that larger t...
ACM试题An Easy Problem Description As we known, data stored in the computers is in binary form. The problem we discuss ...
ACM试题Problem K:Ones Description Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n i...
经典数据结构外国教材Data Abstraction & Problem Solving with C++.的源代码
the program is used to find out the FFT using time in decimation and solves problem of dsp fft ,compared with inbuilt ff...
I used MFC. that code is not perfect and have some problem. But its function is Ok. You just fix and use array of di...
VC++处学者可能用到的小程序,是著名的JOSEPHUS问题,书上已经有,但本人又编了一边
Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
王勖成《有限单元法》里面的教学源程序,PROGRAM OF PLANE PROBLEM 96.1