一个c++推箱子游戏源码

北大ACM试题poj 第3065题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3065 question Question poj source code, good code, and want to help students engage in ACM

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozdagi. Digital computation of the fractional Fourier transform. IEEE Trans. Signal Process., 44:2141{2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C . Candan. The discrete fractional Fourier transform, Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform base

资源描述插入排序，其中包含键盘输入，文件输入，数据结构线性表的应用，函数递归的应用，c语言，

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/   

含有7种排序算法-Includes 7 sorts of sorting algorithm

哈弗漫算法程序，经供参考，有不对之处望大家多多指教~！-Haversian diffuse algorithm procedures, as for reference, hope everyone has a lot of wrong advice ~!

资源描述 可实现小数计算，输入算术表达式的错误检测，运算流程输出等

多目标蝙蝠优化算法是一类寻优精度很高的优化算法，简单实用，且易于实现，算法我已通过运行验证过，很好用，希望能够对大家有所帮助，谢谢！

应用背景这是产生PWM感应电机的SVPWM算法关键技术这种利用MikroC Pro的dsPIC编译器生成的代码

7、满足随机数大于交叉概率的进行交叉，双交叉点交叉法（已实现）8、初始种群中染色体用Floyd方法或扫描法（未实现，想等到收敛性有一定程度的保证后再采用扫描法）9、两点之间的距离是坐标间的直线距离，之后可以用直接输入的距离10、迭代次数不是很稳定，有时候会陷入死循环，停止调试，重新调试即可11、每点击一次重新运行，程序便从头计算一次，目前我自己遇到的最好结果是3辆车、20个点的情况下总路程105.4，最好染色体适应度0.09+12、约束条件是：车辆数量、载重量和里程数。超出载重量或里程数则换车，超出车已有车辆数量就惩罚。13、建立了解决VRP问题的类，需要时派生出不同的参数适应不同问题