使用递归方式求最大公约数和最小公倍数

Posted 2022-12-21 Zhang Jun

#include <stdio.h>
int gcd (int a,int b)
  if(a%b==0)
      return b;   
   else  
	  return gcd(b,a%b);


int main()

	int m,n,t1;
	printf("please input two integer number:");
	scanf("%d%d",&m,&n);
	t1=gcd(m,n);
	printf("The highest common divisor is %d\\n",t1);/*最大公约数*/
	printf("The least common multiple is %d\\n",m*n/t1);/*最小公倍数*/
	return 0;