搜索资源列表
12234
- 解决排列组合问题的通用算法,自然数得拆分,求最大公约数的算法-permutations and combinations to solve problems common algorithm, and a few in the resolution, the common denominator for the algorithm
Gcd_EuclideanExtendedEuclidean
- 实现《现代密码学理论与实践》中，求最大公约数的Euclidean算法和extended Euclidean算法。程序不大，但希望给像我这样的入门者提供一些方便。
gongyueshugongbeishu
- 求最大公约数和最小公倍数的源代码。很简短的求法-Seek the common denominator and least common multiple of the source code. Very brief method
1
- a30求两个数的最大公约数和最小公倍数程序简单易懂-A30 seeking the greatest common divisor and least common multiple procedures are simple
cPP
- 员工管理系统，简单大数问题，对称三位素数，欧几里得求最大公约数（差），深度优先搜索-Staff management system, the problem of large numbers is simple, symmetrical three primes, Euclid find the greatest common divisor (poor), depth-first search