两个整数的最大公约数和最小公倍数

最新推荐文章于 2022-11-10 18:00:00 发布

sasaxie

最新推荐文章于 2022-11-10 18:00:00 发布

阅读量1.3k

点赞数 2

本文链接：https://blog.csdn.net/a191030148/article/details/8170909

版权

成长历程同时被 2 个专栏收录

145 篇文章 1 订阅

订阅专栏

C/C++

141 篇文章 4 订阅

订阅专栏

# include <iostream>

using namespace std;

int main()
{
	int m, n;
	int y = 1, b = 1;
	int temp;
	int count = 0;
	int z[20] = {1};

	cout << "Please input two numbers:\n";
	cin  >> m
		 >> n;

	if(m > n)
	{
		temp = m;
		m = n;
		n = temp;
	}

	for(int val = 2; val <= m; )
	{
		if((m % val == 0) && (n % val == 0))
		{
			z[count] = val;
			++count;
			m /= val;
			n /= val;
		}
		else
		{
			++val;
		}
	}

	for(val = 0; val < count; ++val)
	{
		y = y * z[val];
	}

	b = y * m * n;

	cout << "最大公约数："
		 << y
		 << endl
		 << "最小公倍数："
		 << b
		 << endl;

	return 0;
}