C语言求两个正整数的最大公约数和最小公倍数

#include<stdio.h>
int Commonmin(int m, int n);
int Commonmax(int m, int n);
int main() {
	int m, n,r1,r2;
	printf("Please enter two numbers:");
	scanf_s("%d%d", &m, &n);
	r1=Commonmax(m, n);
	r2=Commonmin(m, n);
	printf("The greatest common divisor is: %d ", r2);
	printf("\n");
	printf("The Lesast common multiple is: %d ", r1);
}

int max(int m,int n){
	if (m > n) {
		return m;
	}
	else {
		return n;
	}
}
int Commonmin(int m, int n) {
	int l = 0;               //定义第一变量l来存满足循环条件的最大因子
	for (int i = 1; i < max(m, n); i++) {
		if (m % i == 0 && n % i == 0) {
			l =i;
		}
	}
	return l;
}


int Commonmax(int m, int n) {
	for (int i = max(m, n); i < (m * n); i++) {
		if (i % m == 0 && i % n == 0) {
			return i;
			break;                    //最小公倍数即是第一次找的满足循环条件的值 在此处结束循环
		}
	}
}