欧几里德算法：辗转求余　　原理: gcd(a,b)=gcd(b,a mod b)　　当b为0时,两数的最大公约数即为a　　getchar()会接受前一个scanf的回车符-Euclidean algorithm: Principles of travel for more than: gcd (a, b) = gcd (b, a mod b) when b is 0, the two common denominator is the number of a getchar () will ac

欧氏距离算法计算错误位置多项式，是Berlekamp-Massey的替代算法。消耗的硬件资源比Berlekamp-Massey算法多，但是可以更节省运算时间。-Euclidean distance algorithm to calculate the error position polynomial, is an alternative Berlekamp-Massey algorithm. The consumption of hardware resources is more than

这是一个用于在欧几里得对象上表示极坐标的图形程序。 该算法扫描有限模块 - 心律失常空间中的重复模式-This is a graphical program for the representation of polar coordinates on Euclidean objects. The algorythm scans for recurring patterns in finite modul- arythmic spaces