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

#include<stdio.h>

main()

{

 int m,n,t;

 printf("please input two integer/n");

 scanf("%d,%d",&m,&n);

if(m==0||n==0)

{printf(“please input non-zero”);}   //输入检错

  if(m<n)

{t=n;n=m;m=t;}   //置换，m始终保持最大

  if(m%n==0) { printf("the greatest common divisor is %d/n",n); printf("the least common multiple is%d/n",m);  }      //能整除，说明m是n的倍数

 

   else  { printf("the greatest common divisor is %d/n",m%n); printf("the least common multiple is %d/n",(m*n)/(m%n));  }  //不能整除，说明它们的最大公约数是m除以n的余数，最小公倍数是~

}_