PAT (Advanced) 1081. Rational Sum (20)

最新推荐文章于 2018-11-08 15:48:49 发布

原创最新推荐文章于 2018-11-08 15:48:49 发布 · 675 阅读

0 ·

CC 4.0 BY-SA版权

Algorithm 同时被 2 个专栏收录

86 篇文章

订阅专栏

PAT

41 篇文章

订阅专栏

本文介绍了一种计算两个整数的最大公约数和最小公倍数的高效算法，通过循环和取余操作实现。该算法不仅适用于初学者理解，也适用于在实际编程中提高效率。

部署运行你感兴趣的模型镜像

#include <iostream>

using namespace std;

long long gcd(long long a, long long b)
{
	long long r;
	while (b > 0)
	{
		r = a % b;
		a = b;
		b = r;
	}
	return a;
}

long long lcm(long long a, long long b)
{
	return a / gcd(a, b) * b;
}

int main()
{
	int n;
	cin >> n;
	long long a1 = 0, b1 = 1, a2, b2;
	long long multiple, factor;

	for (int i = 0; i < n; i++)
	{
		cin >> a2;
		getchar();
		cin >> b2;

		multiple = lcm(b1, b2);
		a1 *= multiple / b1;
		a2 *= multiple / b2;
		a1 += a2;
		b1 = multiple;

		factor = gcd(a1, b1);
		a1 /= factor;
		b1 /= factor;
		if (a1 == 0)
			b1 = 1;
	}
	if (a1 == 0)
		cout << 0;
	else
	{
		if (a1 / b1 != 0)
		{
			cout << a1 / b1;
			a1 %= b1;
			if (a1 != 0)
				cout << " ";
		}
		if (a1 != 0)
			cout << a1 << "/" << b1;
	}
	cout << endl;
}

您可能感兴趣的与本文相关的镜像