搜索资源列表
chess
- 分治法的棋盘覆盖问题,包含输入与输出文件
large_integer
- VC++ 分治法大整数乘法-VC++ divide and conquer large integer multiplication
ChesssBoard
- 分治法棋盘覆盖chess,算法设计的例子-Coverage of sub-rule method chessboard chess, algorithm design examples
RSA
- RSA算法加密与解密，MFC精美的添加SKinMagic皮肤的可视化界面，采用了分治法处理大整数取模问题-RSA algorithm for encryption and decryption, MFC delicate skin to add SKinMagic visual interface, using divide and conquer the problem to handle large integers modulo
DivideConquer
- 使用C使用分治法实现了在一个乱序集合中求最大值,最小值的算法,运行环境：linux,g-The use of C using the divide and conquer to achieve an out of order in order to set the maximum, minimum algorithm, operating environment: linux, gcc
test1_1
- 设有8个运动员要进行比赛，设计一个日程表： 1)每个选手必须与其他7个选手各赛一次； 2)每个选手一天只能赛一次； 要求：根据分治法基本思想-Of eight athletes to compete to design a schedule: 1) Each player must match the other seven players each time 2) Each player race day only once requirements: According to
bigIntMuilt
- 分治法求大整数乘法 只能支持256位乘法而已，不过已经完整实现了分治法，而且可以支持有符号的数-Divide and conquer method for large integer multiplication multiply it can only support 256, but has been completely realized divide and conquer, and can support a number of symbols
Voronoi
- 维诺图的实现，应用分治法实现维诺图，代码详细有注释-Voronoi come true
fenzhifa
- 这是分治法的小程序,来自书本上的作业.没什么大的改变.看看就好-This is a small sub-rule law procedures, the books work. No big change. Look like
Strassen
- 用分治法和递归的思想，实现Strassen矩阵相乘-With sub-rule law and recursive thinking, to achieve Strassen matrices