Location:
Search - 穷举法
Search list
Description: 三色球问题
若有一个口袋放有12个球，其中有3个红的，3个白的和6个黑的，从中任取8个球，
问共
这也是一个可用穷举法求解的问题。
设任取的红球个数为i, 白球个数为 j，则黑球个数为8-i-j，用count统计不同的搭配数目
Platform: |
Size: 249 |
Author: |
Hits:
Description: 自个写的一个穷举法算二十四点的小程序
Platform: |
Size: 486 |
Author: |
Hits:
Description: 穷举法解密文件-exhaustive France declassified document
Platform: |
Size: 3304 |
Author: 军军 |
Hits:
Description: 依据穷举法编写的数独游戏，互相交流 希望能帮助到大家
Platform: |
Size: 105448 |
Author: mrq0320 |
Hits:
Description: 穷举法解密文件-exhaustive France declassified document
Platform: |
Size: 3072 |
Author: 军军 |
Hits:
Description: 输入一个整数，计算这个数的所有因子。利用的是穷举法。-an integer input to calculate the number of all factors. Use Act is exhaustive.
Platform: |
Size: 1024 |
Author: 易杜平 |
Hits:
Description: 用于破解WINDOWS管理员口令的东西，密码穷举法。本程序是在单线程的基础上简单修改而得，未经严格测试，大家可以帮忙把该程序完善以下-for Windows administrators crack passwords things, the password exhaustive law. This procedure was threaded on the basis of simple changes derived, without rigorous testing, we can help him improve following the procedures
Platform: |
Size: 193536 |
Author: 刘向 |
Hits:
Description: 算法的设计方法(C程序):一、迭代法 二、穷举搜索法三、递推法 四、递归五、回溯法 六、贪婪法 -algorithm design method (C program) : 1, 2 iteration, the exhaustive search method three, four recursive method, recursive 5, backtracking 6, greedy algorithm
Platform: |
Size: 34816 |
Author: xuyan |
Hits:
Description: 穷举型密码破译器。可以自定义词典，多线程。visual c++6.0 xp/2-exhaustive type code-breaking device. You can define Dictionary, multithreading. Visual c 6.0 xp/2
Platform: |
Size: 84992 |
Author: wd |
Hits:
Description: 运筹学穷举法求0-1规划程序delphi源码-tacticians Method 0-1 exhaustive planning process delphi FOSS
Platform: |
Size: 219136 |
Author: 刘勇 |
Hits:
Description: 此文章的算法有迭代法、穷举搜索法、递推法、贪婪法、回溯法、分治法、动态规划法等等，有用的的人可以-This article has iteration of the algorithm, exhaustive search method, the recursive method, greedy method, backtracking, sub-rule method, dynamic programming, etc., can be useful
Platform: |
Size: 67584 |
Author: 周健 |
Hits:
Description: 穷举搜索法是对可能是解的众多候选解按某种顺序进行逐一枚举和检验，并从众找出那些符合要求的候选解作为问题的解。
-Exhaustive search method may be the solution of the many candidate solutions one by one according to some order of enumeration and testing, and conformity to identify candidates who meet the requirements of the solution as the solution.
Platform: |
Size: 5120 |
Author: wyj |
Hits:
Description: 迷宫寻找出口 采用穷举法 实现 ，就是 数据 结构中 说的 爬山法 -Maze to find the export using exhaustive method, that is, data structures, said the climbing method
Platform: |
Size: 30720 |
Author: |
Hits:
Description: 穷举法程序-算法分析，是用C写的好经典，马克思手稿…………有三个程序！ -Exhaustive method process- algorithm analysis, is to use C to write a good classic, Marx manuscripts ... ... ... ... There are three procedures!
Platform: |
Size: 2048 |
Author: bingkele |
Hits:
Description: 数学建模中常用的穷举法程序，具有一般性，非常实用-Mathematical modeling method commonly used in the exhaustive process, with the general, very useful
Platform: |
Size: 1024 |
Author: cb |
Hits:
Description: 数独求解程序源代码，采用穷举法，无唯一解-Sudoku solver source code, using brute-force method, no unique solution
Platform: |
Size: 19456 |
Author: wangchenyang |
Hits:
Description: 一些常用的算法设计方法和C++环境下的实现方法。主要包括：迭代法、穷举搜、索法、递推法、递归、回溯法、贪婪法、分治法
-Some commonly used algorithm design methods and C environments are implemented. These mainly include: iterative method, exhaustive search, rope method, recursive method, recursion, backtracking, greedy method, divide and conquer
Platform: |
Size: 28672 |
Author: wgl |
Hits:
Description: 日常生活生产中有大量求极值的问题，一般计算机实现用穷举法或牛顿迭代法，但其计算量非常大。使用单纯形法可根据单纯形各个顶点的目标函数值，加以比较，丢掉其中最坏的点，代之以新点，。-Daily production of a large number of extremum problems, general computer implemented by the exhaustive method or Newton' s iterative method, but its calculation is very large. Simplex method using the simplex according to the objective function value of each vertex, to be compared to losing one of the worst point, replace them with new points.
Platform: |
Size: 119808 |
Author: wangyiping |
Hits:
Description: 使用穷举法并分别用for、while、do…while循环语句求出1..100之间的质数(Use the exhaustive method and use for, while, do, respectively. While loop statement is used to find the prime number between 1..100)
Platform: |
Size: 12288 |
Author: macile
|
Hits:
Description: 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, knapsack problem and so on. In fact, TSP problem is also a 0-1 problem. Of course, these problems are NP problems. For large-scale problems, exhaustive method is unable to find the optimal solution in an acceptable time. This program is only an exercise, and the proud point is that all solutions are arranged by recursive method. Come out.)
Platform: |
Size: 2048 |
Author: 末光 |
Hits: