搜索资源列表
oujilide.rar
- 利用欧几里原理来求出 sa+tb=(a,b) 中的系数 s 和 t，其中(a,b)是a和b的最大公约数，a和b为输入数据。,figure out s,t,(a,b) at the same time after you input a,b.
GCD
- 求sa和tb的和使等于a和b的最大公约数-For sa and tb, and so equal to a and b of the common denominator
Lab05
- 计算最小公倍数和最大公约数 字符串加密和解密 计算π的近似值 输出所有的水仙花数-Least common multiple and greatest common divisor calculation of string encryption and decryption of all output approximation to calculate π few daffodils
gcd_and_extend_gcd
- 欧几里得算法与扩展欧几里得算法求最大公约数与乘法逆元-Euclidean algorithm and extended Euclidean algorithm for the greatest common divisor and multiplicative inverse