求最小公因式2种方法

#include<iostream>
using namespace std;
int gcd_byDivide(int max,int min){
	return (min==0)?max:gcd_byDivide(min,max%min);
}
int gcd_bysubtraction(int max,int min){
	while(max!=min){
		if(max>min) max=max-min;
		else min=min-max;
	}
	return max;
}
int main(){
		int n,m,max,min,greatest_common_divisor;
	printf("please input two number:\n"); 
	while(scanf("%d %d",&n,&m)!=EOF){		 
		 max=n>m?n:m;
		 min=n<m?n:m;
		greatest_common_divisor= gcd_byDivide(max,min);//调用函数比较快 
		printf("最大公约数%d\n",greatest_common_divisor);
		printf("最小公因数%d\n",n*m/greatest_common_divisor);
		printf("please input two number:\n"); 
	}
}