输入两个正整数m和n，求其最大公约数和最小公倍数。

 #include<stdio.h>
#define STRAS "*****************************"
int gcd(int a, int b);  //最大公约数
int lcm(int a, int b);  //最小公倍数
int main(void)
{
    int n, m;
    int result_gcd, result_lcm;
    printf("Enter two integers.Please:(q to quit)");
    while(scanf("%d%d",&n,&m) == 2)
    {
        result_gcd = gcd(n,m);
        result_lcm = lcm(n,m);
        printf("\n%s\n\n",STRAS);
        printf("greatest common divisor:   %d\n",result_gcd);
        printf("least common multiple:     %d\n",result_lcm);
        printf("\n%s\n",STRAS);
        printf("Enter two  integers again,please:(q to quit)");
    }
    printf("Thank you for your use! goodbye!!\n");
    getchar();
    return 0;
}
//int gcd(int a,int b)
//{
//    return b == 0 ? a : gcd(b,a%b);
//
//}


int gcd(int a, int b)
{
    int temp;
    if(a > b)    //如果第一位数大于第二位，这里需要交换一下位置
    {