资源列表
1
- 设有n个人站成一圈，每个人持有一个密码（正整数)。现从第t个人开始，按顺时针方向“1,2,3,4,…”循环报数，数到m1（第t个人所持密码）的人出列，然后从出列者的下一个人重新开始报数，数到m2（刚出列者所持密码）的人又出列，如此重复进行，直到n个人都出列为止。-something like Joseph problem
TowerofHanoi
- 输入汉诺塔的总阶数，就可以显示汉诺塔的移动步骤，即每一步的移动，最后显示移动的总次数-Enter the Tower of Hanoi s total order, we can show the movement of Hanoi Tower, that is, to every step of the movement, and finally show the total number of mobile
lcs
- 一道经典的动态规划题目 浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
Netherlandsflag
- 荷兰旗问题，数据结构中比较简单的问题，复杂度为O（n）。-Dutch flag issue
newton
- 牛顿迭代法解非线性方程，可自定义迭代步数和迭代精度，结果可返回解得所有迭代过程，适合于就算方法的初学者作为上机实验的参考资料。-Newton iterative method for solving nonlinear equations, can be customized and iterative precision iterations, the result can be returned to solve for all the iterative process, even if
001
- 求字符串next数组，实现快速模式匹配，将文件直接在C++环境下执行即可-String array for next, realizing fast pattern matching
cpu-time-module
- 系统时间记录模块 只要将开始和结束的 模块放到相应的地方就可以了-System time recording module will begin and the end of the module into the appropriate place on
Frequency-value
- 频率值。要求输入一个非递减序列，再输入所要查询的区间，然后统计此区间内出现最多的值的次数。-Frequency value. Asked to enter a non-decreasing sequence, and then enter the query interval, then the number of statistics in this range the most value.
assignment3G11t
- 为了拟合高阶传递函数到一阶，时域方法。。。还有频域方法，但是效果并不理想-In order to fit the high-end pass function to order
system_response
- This file contains the 3 responses of any system. This is generalized code
16to8
- 输入一个任意长度的十六进制的数，自动计算产生所对应的八进制的数。-Enter a hexadecimal number of arbitrary length, corresponding to the octal number generated automatically calculated.
0-1-backpack
- 本代码提供0-1背包问题的动态规划解法，适用于背包容量是整数类型-The code provides 0-1 knapsack problem dynamic programming solution for the backpack capacity is an integer type