搜索资源列表
bianyi
- 汇编原理课设：主要有词法分析，语法分析，语义分析- A program to perform Euclid s Algorithm to compute gcd.
Evklid
- This program implements the extended algorithm of Euclid.
gcd
- oujilide suanfa de kuozhansuanfade shxiamzj jdsa lfjdas f-Euclid suandafa a ldjfdkuodahznadnfa,dfna dsfjdas fjdas
Euclid
- 用JAVA来求最大公约数，这个程序主要是用来熟悉JAVA编程所用的-Using JAVA to find the greatest common divisor, the program is primarily designed to be familiar with the JAVA programming
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
xinxisafe
- 信息安全实验代码 包括维吉尼亚密码 凯撒密码 欧几里得密码 置换密码等，附实验报告-Test code includes information security Caesar Virginia password passwords password Euclid password replacement, with test report
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
Euclid
- 扩展欧几里得算法的大数实现,实现任意两个大数求莫逆-Large numbers of extended Euclidean algorithm implementation
Algorithm-template
- C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho
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
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.
euclid1
- c++ implementation of euclid works on visual studio 2010 express on windows xp professional
euclid4
- Visual studio c++ 2010 express implementation of euclid algorithm
euclid2
- visual studio c++ 2010 express extended euclid algorithm
Greatest-common-divisor-(GCD)
- 用递归调用和辗转相除法求两个整数的最大公约数（输入多组数据，每个数在1到1000之间；输出为一行一个公约数）。-Calculate and output the greatest common divisor (GCD) of a pair of integers.The classic algorithm for computing the GCD, known as Euclid’s algorithm, goes as follows: Let m and n be variables c
Euclid
- 欧几里得算法,用来计算两个数的最大公约数。此算法，基于数论的偶记离得算法-Euclidean algorithm, used to calculate the greatest common divisor of two numbers. This algorithm, based on number theory even remember from the algorithm
Euclidean-algorithm
- 欧几里得算法 非常给力 值得参考 招来不易啊-Euclid' s algorithm is very difficult to force ah worth considering provoke