搜索资源列表
GongyueshuGongbeishuthoughkey
- 在java开发环境下求最大公约数和最小公倍数，操作数从键盘输入。-in java development environment for the common denominator, and least common multiple, operating from a few keyboard input.
ZXZD
- 这是个求最大公约数，最小公倍数的小程序，适合初学者看看。-This is for the common denominator, the small implements procedures for beginners to see.
UseRecursion
- JAVA预言编写自动求输入数字的最大公因子
GCD_recursion
- 用递归方法求最大公因数！！！不是什么难的程序，小的程序。。大家一起探讨！-Method Using Recursive gcd! ! ! Not a difficult procedure, a small procedure. . Everyone to explore!
GreatestCommonDivisor
- 这是一个求最大公约数的java程序，程序很简单，很容易看懂的
Gcdtest
- 求给定的一组整数的最大公约数和最小公倍数， 整数的个数不限，当输入-1时程序结束。-Demand for a given set of integers of the greatest common divisor and least common multiple, the number of integers not limited to, when the input-1 when the end of the process.
1000
- 学习java时所做实验的全部代码，包括applet和用户应用程序。程序代码有画图形的，（五角星，多边形，圆等等）有求最大公约数，最小公倍数的，还有很多其他的-Experimental study made when all the java code, including the applet and the user applications. Picture in graphics code, (five-pointed star, polygon, circle, etc.) are se
MaxMin
- 描述： Hanks 博士是BT (Bio-Tech，生物技术) 领域的知名专家，他的儿子名叫Hankson。现在，刚刚放学回家的Hankson 正在思考一个有趣的问题。 今天在课堂上，老师讲解了如何求两个正整数c1 和c2 的最大公约数和最小公倍数。现在Hankson 认为自己已经熟练地掌握了这些知识，他开始思考一个“求公约数”和“求公倍数”之类问题的“逆问题”，这个问题是这样的：已知正整数a0,a1,b0,b1，设某未知正整数x 满足： 1． x 和a0 的最大公约数是a1
Euclid
- 用JAVA来求最大公约数，这个程序主要是用来熟悉JAVA编程所用的-Using JAVA to find the greatest common divisor, the program is primarily designed to be familiar with the JAVA programming
Common-factor
- Java 程序 源码 用辗转相除法求两个整数的最大公因数。-Java source code using Euclidean algorithm for greatest common factor of two integers.
zdgys
- 用java语句实现简单的程序 求最大公因数 初学者适用-Statement with the simple java program for beginners to find the greatest common factor
com
- 程序分析：求两数的最大公约数和最小公倍数-Program analysis: find the greatest common divisor and least common multiple of two numbers
src
- 求最大公约数，和最小公倍数的简单的小程序，对初学者很有用的，-just a small bean ,i hope it,s good for the new to learn JAVA
newJava
- 十个经典Java编程算法（判断是否是素数，求最大公倍数和最小公约数等等）-The ten classic Java programming algorithm (to determine whether it is a prime number, find the greatest common multiples and minimum divisor)
JAVA
- 一些常见JAVA基本代码实现，求两个数的最大公约数和最小公倍数，递归调用，求某年某月某日为星期几等。-Achieve some common basic JAVA code, find the greatest common divisor and least common multiple of two numbers, the recursive call, seeking a certain period of a day for the week, etc..
GCDP
- 演算法-透過輾轉相除法求出最大公因數, 再透過最大公因數求最小公倍數,最大公因數(GCD)可以使用輾轉相除法來求，最小公倍數(LCM)則由這個公式來求 : GCD * LCM = 兩數乘積-Algorithm- through Euclidean division to find the greatest common factor, through the greatest common factor and least common multiple and greatest com
GCD
- 求最大公约数和最小公倍数的算法，输入任意里两个整数，输出他们的最大公约数和最小公倍数。-Seek the greatest common divisor and least common multiple of the algorithm, enter any two integers, and output their greatest common divisor and least common multiple.
qiuzuidagongyueshuchenxu
- 求最大公约数的c语言程序 程序优化的很好-Find the greatest common divisor of c language program
zuidagongyinshu
- 使用Java语言编写的求最大公约数的非常实用的代码，此代码完全正确。-Use Java language greatest common divisor of very useful code, which is completely correct.
Rational
- 通过分装分母和分子实现对有理数的封装，用循环法求最大公约数(The packing of the denominator and numerator rational number of the package, the common denominator for recycling method)