正文
c语言自定义函数求两个数 c语言自定义函数求两个数最小值
小程序：扫一扫查出行【扫一扫了解最新限行尾号】
复制小程序
C语言，C++ 自定义函数，求两个整数的最小公倍数
#includestdio.h
int gcd(int a,int b) //求最大公倍数
{
int m,n,r;
m=a=b?a:b; //m保存较大数
n=ab?a:b; //n保存较小数
r=m%n; //求余数
while(r!=0) //循环相除
{
m=n;
n=r;
r=m%n;
}
return n;
}
int lcm(int a,int b) //求最小公倍数
{
int t=gcd(a,b); //获取最大公约数
return (a*b)/t; //返回最小公约数
}
int main()
{
int a,b;
printf("输入两个整数:");
scanf("%d%d",a,b);
printf("最小公倍数：%d\n",lcm(a,b));
return 0;
}
C语言 用自定义函数，实现求两个数的最大公约数
#include stdio.h
void swap (int *p_a,int *p_b){ //make a always =b
int temp;
temp =*p_b;
*p_b = *p_a;
*p_a = temp;
}
int G_D(int a, int b){ //define the function for Greatest Divisor
int i, G_Dvalue;
for (i=b;i0;i--){
if ((a%i==0)(b%i==0)){
//printf("This is the %dth run\n", i);
G_Dvalue =i;
break;
}
}
return G_Dvalue;
}
int L_M(int a, int b){ //define the function for least multiple
int i, L_Mvalue;
for (i =b; i a*b+1; i++){
if (i%a==0 i%b==0){
L_Mvalue =i;
break;
}
}
return L_Mvalue;
}
int main()
{
int m, n; //input 2 int
int Greatest_D, Least_M; //define greatest divisor AND least multiple
printf ("Pls input 2 integter:\n");
scanf ("%d", m);
scanf ("%d", n);
//printf ("m is %d, n is %d\n", m,n);
if (mn){
swap (m, n);
}
//printf ("m is %d, n is %d\n", m,n);
Greatest_D = G_D (m,n);
printf ("The greatest divisor is:%d\n", Greatest_D);
Least_M = L_M(m,n);
printf ("The least multiple is:%d\n", Least_M);
return 0;
}
c语言中利用自定义函数，求出两个数的最大公约数
#include stdio.h
int fun(int m,int n)
{
int t;
while(n) {t=m%n;m=n;n=t;}
return m;
}
void main()
{
int m,n;
scanf("%d%d",m,n);
printf("最大公约数: %d",fun(m,n));
}
