CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - gongyueshu
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - gongyueshu - List
[
EditBox
]
GongYueshu
DL : 0
最大公约数的在Windows界面下的小程序
Date
: 2008-10-13
Size
: 25.66kb
User
:
jiangjian
[
EditBox
]
GongYueshu
DL : 0
最大公约数的在Windows界面下的小程序 -Common denominator in the Windows interface of the applet
Date
: 2025-07-16
Size
: 421kb
User
:
jiangjian
[
Windows Develop
]
gongyueshu
DL : 0
有键盘输入两个正整数m,n,然后输出m,n的最大公约数和最小公倍数,采用了辗转相除法得到最大公约数p,然后用m,n的乘积除以p即得最小公倍数。-There are keyboard input two positive integers m, n, then output m, n the common denominator and least common multiple using the division algorithm to be the common denominator p, then m, n the product divided by the smallest p that is a public multiples.
Date
: 2025-07-16
Size
: 864kb
User
:
灵药
[
Other
]
gongyueshu
DL : 0
实现的功能为求解两个数的最大公约数与最小公倍数-To achieve the two functions for solving the common denominator and least common multiple number of
Date
: 2025-07-16
Size
: 1kb
User
:
张琪
[
matlab
]
gongyueshu
DL : 0
输入两个正整数m和n,求其最大公约数和最小公倍数。 利用辗除法。-Enter two positive integers m, n, of seeking the common denominator and least common multiple. The use of rolling division.
Date
: 2025-07-16
Size
: 1kb
User
:
阿贝
[
File Operate
]
gongyueshu
DL : 0
函数调用求最大公约数的函数 而且调用函数的方法-Function call seeking the common denominator of the function and method calls the function
Date
: 2025-07-16
Size
: 146kb
User
:
陈辰
[
Windows Develop
]
gongyueshu
DL : 0
找两个数的最大公约数 找两个数的最大公约数-Find greatest common divisor of two numbers
Date
: 2025-07-16
Size
: 4kb
User
:
xy
[
Other Databases
]
zb_maxgys
DL : 0
一段十分实用的VFP程序,可以实现最大公约数-Max GONGYUESHU
Date
: 2025-07-16
Size
: 1kb
User
:
MLZ
[
Algorithm
]
gongyueshu
DL : 0
由欧几里得,连续整数检测,分解质因数算法得最大公约数,并分析各种算法的时间性-By the Euclid, consecutive integers detection, decomposition of the prime factors have the greatest common divisor algorithm, and analyze the timing of various algorithms
Date
: 2025-07-16
Size
: 1kb
User
:
zhong
[
CSharp
]
qiuzuida-gongyueshu
DL : 0
这是一个用C#编写的程序,主要是最大公约数的问题,有欧几里得算法,循环测试法,因式分解等。-this is a code written by C#.
Date
: 2025-07-16
Size
: 86kb
User
:
张志强
[
File Format
]
gongyueshu
DL : 0
输入两个正整数m和n,求其最大公约数和最小公倍数。-Enter two positive integers m and n, find the greatest common divisor and least common multiple.
Date
: 2025-07-16
Size
: 6kb
User
:
小雨李
[
JSP/Java
]
gongyueshu-
DL : 0
用c++语言求数的公约数和公倍数 简单的程序-With c++ language requirements divisor and common multiple of the number of simple procedures
Date
: 2025-07-16
Size
: 1kb
User
:
jia
[
Other
]
gongyueshu
DL : 0
求最大公约数 Seek the greatest common divisor-Seek the greatest common divisor
Date
: 2025-07-16
Size
: 5kb
User
:
wuhen
[
Other
]
gongyueshu
DL : 0
描述: 计算多个(最多100个,最少一个)正整数(正整数的范围是:1~20000)的最大公约数。公约数 是指:能被所有的整数整除的整数。 输入: 第一个数字是整数的数量,后面是每个整数的具体值; 备注:读取的时候,不需要读入换行符’\n’ 输出: 最大公约数 备注:输出的时候,不需要输出换行符’\n’ 样例输入: 4 5 10 15 20 样例输出: 5 -Description: Calculation of multiple (up to 100, at least one) positive integer (positive integer in the range: 1 to 20000) the greatest common divisor. Common divisor Means: all integers can be an integer divisible. Input: The first number is an integer number, followed by the specific value of each integer Note: When read, no read newline \ n Output: The common denominator Note: When the output, no output newline character \ n Sample input: 4 5101520 Sample output: 5
Date
: 2025-07-16
Size
: 1kb
User
:
xhj
[
Software Engineering
]
gongyueshu
DL : 0
Visual Studio 自带的Web Server也可以运行ASP .NET应用,Web Server是为了方便开发者快速启动及调试网站的产品,后期被IIS Express取代。-Studio Web comes with the Server ASP can also run the.NET Visual application, Server Web is to facilitate the developer to quickly start and debug the site s products, the latter was replaced by Express IIS.
Date
: 2025-07-16
Size
: 14kb
User
:
李涵
[
JSP/Java
]
gongyueshu-gongbeishu
DL : 0
输入两个正整数m和n,求其最大公约数和最小公倍数。-Enter the two positive integers m and n to find the greatest common divisor and the least common multiple
Date
: 2025-07-16
Size
: 1kb
User
:
杨丹
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.