Project Euler：Problem 34 Digit factorials

标签：c++   project euler   gcd   

The fraction ⁴⁹/₉₈ is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that⁴⁹/₉₈ = ⁴/₈, which is correct, is obtained by cancelling the 9s.

We shall consider fractions like, ³⁰/₅₀ = ³/₅, to be trivial examples.

There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.

If the product of these four fractions is given in its lowest common terms, find the value of the denominator.

#include <iostream>
using namespace std;

int gcd(int a, int b)
{
	while (b)
	{
		if (a < b)
		{
			int tmp = b;
			b = a;
			a = tmp;
		}
		int t = b;
		b = a % b;
		a = t;
	}
	return a;
}

int main()
{
	int fz = 1;
	int fm = 1;
	int res;
	for (int x = 10; x <= 98; x++)
	{
		for (int y = x + 1; y <= 99; y++)
		{
			int a = x / 10;
			int b = x % 10;
			int c = y / 10;
			int d = y % 10;
			if ((b - c) == 0 && (y*a == x*d) && (d != 0))
			{
				fz *= a;
				fm *= d;
			}
		}
	}
	res = fm / gcd(fz, fm);
	cout << res << endl;
	system("pause");
	return 0;
}

Project Euler：Problem 34 Digit factorials

标签：c++   project euler   gcd   

原文地址：http://blog.csdn.net/youb11/article/details/46342347