搜索资源列表
a223
- 此程式可輸入二個整數，並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
euclid
- 欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。
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
Evklid
- This program implements the extended algorithm of Euclid.
EUCLID
- 辗转欧几里得算法 求多项式逆 网路安全中的算法-Inverse polynomial Euclidean algorithm was removed network security algorithms
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
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.
CTRL02
- Triangles can be classified according to the relative lengths of their sides: In an equilateral triangle all sides have the same length. An equilateral triangle is also a regular polygon with all angles measuring 60°.[1] In an isosceles triangle,
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
Project1
- extended euclid algorithm in korean
mcd
- This program calculates the lowest common multiple of two numbers using Euclid s algorithm. To do this we will read the two numbers and we do accounts required to calculate
Euclid
- 用C语言使用欧几里德算法求任意两个正整数的最大公约数-Realize, by using c/c++ or Matlab, the Euclidean algorithm and the extended Euclidean algorithm to calculate the greatest common division (GCD) of any two positive integer numbers