搜索资源列表
ChessboardCover
- Chessboard Cover,On a chessboard，only one square is different, called specific.Use the Divide-and-Conquer methods to solve the Chessboard Cover Problem.-Chessboard Cover, On a chessboard. only one square is different, specific.Use called the Divide -
将军互联号码生成器
- 西木头的东西喜欢弄一些让人不喜欢的特性，比如同一序列号安装出来的东西无法联机啦。没办法我只好写了这个东西。。。针对《命令与征服-将军》,太简单了,不知道能不能通过审核-West wood things like get some people do not like characteristics, such as the installation of the same sequence of the things it can not be on-line. No way I had to
large_integer
- VC++ 分治法大整数乘法-VC++ divide and conquer large integer multiplication
recurs
- /* Divide and Conquer */ /* Find minimum and maximum from a given series of numbers */ /* by using above said policy */ gcd fibonacci-/* Divide and Conquer*/ /* Find minimum and maximum from a given series of numbers*/ /* by using
ccplusplus
- 《征服CC++企业软件开发核心技术》源代码，其中包括linux和window的代码，对线程，网络通信，数据库等有说明。-" Conquer the CC++ enterprise software development of core technologies," the source code, including linux and the code window for the thread, network communications, database, such
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
ThereisnodifficulttolearnLinux
- 大学生攻克Linux系统教程(又名天下没有难学的Linux)。一位在校大学生整理的教程，献给每一位要征服Linux的学习者－五星级的Linux教程。 本书汇集众多Linux学习者的心血与贡献，有很多作者在默默的为你呼喊，感谢他们的贡献。从学习Linux的那天起，我只记住一个词，那就是攻克。 一个障碍，一个学习Linux的最大障碍－无指导－在困扰着每一位企图闯出初中级Linux困境的人。攻克Linux系统教程给你提供动力，帮助你闯出难关。为何这么有把握？原因很简单，天
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
bits
- CMU CSAPP LAB1 位级操作 其中bitcount函数用到了较为简便的分治思想-CMU CSAPP LAB1 bit-level operations which bitcount function uses a relatively simple Divide and Conquer
GamePatcher
- VB源代码编写实现的命令与征服系列图形补丁程序，如果游戏当前在运行中，可能无法进行操作！游戏运行前请将本补丁程序放置在游戏-VB source code is written to achieve the Command & Conquer series graphics patch, if the game is currently running, you may not be able to operate! Games run before you put the patch i
2_a25
- 利用C语言，并使用分治算法，解决最近点对问题。-The use of C language and use divide and conquer algorithm to solve the problem closest point.
STRING
- 使用分治思想，利用C语言，求得最长公共子串问题-Using Divide and Conquer, using C language, and seek the longest common subsequence problem
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
randtest
- 密码学教学实验工具是《密码学基础》实验教学的辅助工具软件，由DES加密算法、随机性测试、素数工具和辗转相除法四部分组成。该软件的运行平台为windows2000/2003/XP，通过执行Crypt.exe启动，包含Crypt.exe和相关库文件。(Cryptography teaching experiment tool is the auxiliary software of cryptography experiment teaching. It consists of four parts