最大公约数与最小公倍数 函数算法

解题思路:简单题 想想就好了

注意事项:

参考代码:

#include<iostream>

using namespace std;

int max(int m,int n)

{

int a = 0;

if (m > n)

{

a = m;

}

else

{

a = n;

}

int count = 0;

for (int i = 1; i <= a; i++)

{

if (m % i == 0 && n % i == 0)

{

count = i;

}

}

return count;

}

int min(int m, int n)

{

int a = 0;

int b = 0;

int count = 0;

if (m < n)

{

a = m;

}

else

{

a = n;

}

b = m * n-1;

for (int i = b; i > a; i--)

{

if (i % m == 0 && i % n == 0)

{

count = i;

}

}

return count;

}

int main()

{

int m, n;

cin >> m;

cin >> n;

if (m > 0 || n > 0)

{

int max0 = max(m, n);

int min0 = min(m, n);

cout << max0 << " " << min0;

}

system("pause");

return 0;

}