搜索资源列表
实验课第1讲
- C++分数辗转相除 除非用我这种方法, 若不是求不出的,-C scores made his eliminate unless I use this method, if it is not seeking,
GYS
- 用辗转相除发求最大公约数-made his eliminate fat used for the common denominator
zhanzhuanxiangchu
- 输入两个数，进行辗转相除求他们的最小公因数-Enter the two numbers, the euclidean division seeking their least common factor
app
- 辗转相除的算法 辗转相除的算法 -Euclidean division algorithm euclidean division algorithm euclidean division algorithm euclidean division algorithm
juggling
- 翻转算法，效果：abcdefg->defgabc 使用到辗转相除求最大公约数。-The Flip algorithm, the effect: abcdefg-> defgabc use to euclidean division of the common denominator.
poi
- 编写程序要求：允许用户输入两整数求出并输出两整数大公约数(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
oushisuanfa
- 用辗转相除的方法求了两个数的最大公约数，包含二进制以及大数的公约数的求法-Euclidean algorithm, using Euclidean find the greatest common divisor of two numbers
辗转相除2
- 用简便的辗转相除求最大公约数，用三种方法for，while，do while(For the common denominator with a simple division, with the three methods of for, while, do, while)