【C语言】输入两个正整数 m 和 n, 求它们的最大公约数和最小公倍数

1. 参考程序:

#include<stdio.h>
void main()
{
    //
辗转相除法
    int m,n,p,r,temp;
    printf("input the two number m,n:\n");
    scanf("%d,%d",&m,&n);
    if(n<m)
    {
        temp=n;
        n=m;
        m=temp;
    }
    p=n*m;
    while(m!=0)
    {
        r=n%m;
        n=m;
        m=r;
    }
    printf("the greatest common divisor:%d\n",n);
    printf("the lowest common multiple:%d\n",p/n);
}

#include<stdio.h>
void main()
{
    //
辗转相除法
    int m,n,p,r,temp;
    printf("input the two number m,n:\n");
    scanf("%d,%d",&m,&n);
    m=abs(m);
    n=abs(n);
    if(n<m)
    {
        temp=n;
        n=m;
        m=temp;
    }
    p=n*m;
    while(m!=0)

    {
        r=n%m;
        n=m;
        m=r;
    }
    printf("the greatest common divisor:%d\n",n);
    printf("the lowest common multiple:%d\n",p/n);
}

猜你喜欢

转载自blog.csdn.net/sdbx_lyp/article/details/80185237