搜索资源列表
a223
- 此程式可輸入二個整數，並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
acscontrol
- 带约束的蚁群算法的程序，用于欧几里德（Euclid）TSP问题，用c语言编写的，供大家借鉴-Constrained Ant Algorithm procedures for Euclidean (Euclid), TSP, c language used, for everybody's reference
euclid
- 欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。
midify_euclid
- 修正的euclid算法matlab程序，验证通过
qu
- 就是两个多项式的欧几里得算法，即求两个多项式的最大公约数。-two polynomial is the Euclid algorithm, namely polynomial for the two majors.
euclid
- 欧几里德算法和一些其他的简单功能。 求最大公约数之类-Euclidean algorithm and some other simple functions. Such as seeking common denominator
POJ2115
- ACM POJ 2115 扩展欧几里得算法解题报告-ACM POJ 2115 Euclid algorithm for solving the report of the expansion
Evklid
- This program implements the extended algorithm of Euclid.
Euclid
- 使用欧几里德算法求最大公倍数,内有欧几里德算法的步骤。-Euclid Algorithm
EUCLID
- 辗转欧几里得算法 求多项式逆 网路安全中的算法-Inverse polynomial Euclidean algorithm was removed network security algorithms
aco
- 蚁群算法解欧氏平面上的TSP问题。包括了2-opt、3-opt优化，经过了若干经典数据的测试。-AntColony algorithm solving the TSP problem in Euclid plane, including 2-opt and 3-opt optimization. It has been tested by authorized data.
gongyueshu
- 由欧几里得，连续整数检测，分解质因数算法得最大公约数，并分析各种算法的时间性-By the Euclid, consecutive integers detection, decomposition of the prime factors have the greatest common divisor algorithm, and analyze the timing of various algorithms
math-problems
- 一些数学问题算法模板，稍微做了下分类 目录 1 欧几里得和模线性方程 欧几里德 扩展欧几里德 模线性方程 2 欧拉φ函数 扩展欧拉函数 3 线性时间素数筛法 生成欧拉函数表 4 因式分解 5 Nim游戏和sg函数 合肥B 题 -Some mathematical problems algorithm template, do a little under Categories 1and mode of linear eq
UVA_for_C
- The file include: UVa 10104 Euclid Problem, UVA 861 LittleBishop, UVA 10018 Reverse, UVA 846 Step, UVA 10191 Longestnap -The file include UVa 10104 Euclid Problem, UVA 861 LittleBishop, UVA 10018 Reverse, UVA 846 Step, UVA 10191
extended-euclid
- 经典的Extended-Euclid算法，计算GCD-implement Extended-Euclid
Solve-Modular-Linear-Equations
- 解模块线性方程组, solve modular linear equations, 用到了extended-euclid算法求最大公约数-solve modular linear equations, use extended-euclid to compute the greatest common divisor..
extend_euclid
- this extended euclid source code-this is extended euclid source code
The-Elements-of-Euclid
- This edition of the Elements of Euclid, undertaken at the request of the principals of some of the leading Colleges and Schools of Ireland, is intended to supply a want much felt by teachers at the present day—the production of a work which, wh
extend_gcd
- 数论中最基础、最重要的的拓展欧几里德模板。拓展欧几里德用于求逆元，在本模板中已经把类型改成了long long。-Number theory is the most basic and most important expansion of the Euclidean template. Expand Euclid for inverse element in the template has been turned into a long long type.
based-on-Euclid
- 自己以前写的基于欧几里得的小程序。 1.判断一个整数是不是素数 2.计算两个整数的最大公约数 3.计算两个整数的最小公倍数 4.将输入的a,b表示成s*a+t*b=gcd(a,b)的形式 5.求输入的a,m中a模m的逆元-A small program based on Euclid . 1. Determine an integer is not a prime number 2 Calculate