搜索资源列表
a223
- 此程式可輸入二個整數，並以歐幾里得演算法求其最大公因數(GCD)-this program can import two integers, and Euclid algorithms for its greatest common divisor (GCD)
GCD
- 最大公约数最小公倍数的C++求解，提供了多种思路解答，
GCD
- GCD为一个求取最大公因素的程式，输入两个数可以求得两数的最大公因素
Gcd
- 里面含有几种经典的关于求最大公约数的经典求法比较，想必对数学类专业的同学有用。-several ways to get GCD
gcd_lcm
- 给出两整数a与b, 找出a与b的最小公倍数LCM(a,b), 找出a与b的最大公因子GCD(a,b).-finds the LCM(Lowest Common Multiple)/GCD(Greatest Common Divisor) of two positive integers
gcd
- 利用GCD算法迭代求解两个数最大公约数的算法，并有实例-GCD algorithm using iterative algorithms for solving the greatest common divisor of two numbers, and examples
013
- 通过字符串操作模拟控制台的cd命令，要求至少完成 “cd 【目录名】”、“cd ..” 和“cd \” 三个命令。实例可以参考:开始->运行->cmd->键入上述三个命令观察提示符前的字符串变化，帮助可通过cd /?显示；可使用字符串处理函数。并用此程序练习和熟悉调试过程。 实验014：重写实验007和012，要求使用函数IsPrime实现判断一个数是否是素数，GCD返回两个数的最大公约数，LCM返回两个数的最小公倍数，并在main中调用。-Through the stri
mycode
- hdu 1695 GCD (增加点字符）-hdu 1695 GCD (increased dot character)
GCD_LSB
- GCD and LSB algorithm.
main.cpp_1
- This program calculate if two numbers are coprimes For given integer N (1<=N<=10^4) find amout of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only
oujilide
- 广义欧几里得算法，用以计算两个数的最大公约数，依靠定理定理：gcd(a,b) = gcd(b,a mod b)-Generalized Euclidean algorithm for computing the greatest common divisor of two numbers, relying on Theorem Theorem: gcd (a, b) = gcd (b, a the mod b)
gcd
- 最大公约数程序，使用多种方法来计算最大公约数-The greatest common divisor of the program, using a variety of methods to calculate the greatest common divisor
GCD-and-LCM
- a simple program getting two numbers and calculating the GCD and LCM for them
1-(a-b)
- 此程序为利用广义欧几里德算法求解最大公约数GCD-This procedure for the use of the generalized Euclidean algorithm for solving the greatest common divisor GCD
hdlsrc
- In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), or highest common factor (hcf), of two or more integers(at least one of which is not zero), is the largest positive integer that divides the numbers wi
gcd
- 数学算法，最大公约数算法以及其扩展应用，ACM材料。-Mathematical algorithms, the greatest common divisor algorithm and its extended application, ACM materials.
Number-Theory
- 这里包含了各类数论基本算法：素数筛法，偶拉函数，欧几里德算法，扩展欧几里德算法，求逆元，线性模方程组-it contains many Number theory algorihm: prime sieve, euler function, gcd, exgcd, mod inv, congruence_equation
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
gcd algorithm
- GCD alogithm is described.
LCM-a-GCD
- LCM & GCD Function -LCM & GCD Function .....