欧几里德距离的C++算法，在人工免疫系统中有广泛的应用-Euclidean distance between the C algorithms, artificial immune system in a wide range of applications

扩展欧几里德算法不但能计算(a,b)的最大公约数，而且能计算a模b及b模a的乘法逆元。平方和乘算法的复杂度：执行次数至少要k次模乘，最多需要２ｋ次模乘。-Extended Euclidean algorithm for computing not only (a, b) the common denominator, and to calculate a modulus b and b modulus a multiplicative inverse of. Square and by the

欧几里德最大公因子算法 欧几里德最大公因子算法-Euclidean algorithm Euclidean greatest common factor greatest common factor algorithm

编写程序要求：允许用户输入两整数求出并输出两整数大公约数(Common denominator)里介求公约数算法--欧几里德算法又称辗转相除法其计算理下：用a除b取余数a1 a1 = 0, 则b大公约数 否则用 b 除a1取余数a2 a2 = 0则a1大公约数 否则用 a1 除a2取余数a3a3 = 0则a2大公约数 否则用a2除a3取余数a4-Program requirement: allows the user to enter two integers and big Common di