搜索资源列表
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
03
- 创建动态链接库，当中以求最大公约数和最小公倍数两个函数编译动态链接库-Dynamic_Link Library
Lab05
- 计算最小公倍数和最大公约数 字符串加密和解密 计算π的近似值 输出所有的水仙花数-Least common multiple and greatest common divisor calculation of string encryption and decryption of all output approximation to calculate π few daffodils
zdgys
- 本源代码是求的是最大公约数的功能，代码清晰简单，用VC完成的-The source code is the demand is the greatest common divisor of the function, the code is clear and simple, complete with VC
gcd_and_extend_gcd
- 欧几里得算法与扩展欧几里得算法求最大公约数与乘法逆元-Euclidean algorithm and extended Euclidean algorithm for the greatest common divisor and multiplicative inverse
COSC_2425_LY_Project3
- 汇编程序语言，用户输入留个数字，程序运行后可以列出每个数字的最大公约数-find the greatest common divisor of the six number which are typed by the user.
72673203
- 最大公约数算法程序,是一个网站上下载下来的,比较好的,共享,(Greatest common divisor algorithm program, is a website, a good, sharing,)