Project Euler：Problem 34 Digit factorials

最新推荐文章于 2022-03-27 21:29:05 发布

bit小兵

最新推荐文章于 2022-03-27 21:29:05 发布

阅读量53

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/wzjhoutai/p/7300798.html

本文介绍了一种算法，用于寻找所有等于其各位数字阶乘之和的数，并计算这些数的总和。通过分解每个数字为各位数字并计算阶乘，再比较其和是否与原数相等来实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.

Find the sum of all numbers which are equal to the sum of the factorial of their digits.

Note: as 1! = 1 and 2! = 2 are not sums they are not included.

#include <iostream>
#include <vector>
using namespace std;

vector<int> int_vet(int a)
{
	vector<int> res;
	while (a)
	{
		int tmp = a % 10;
		a /= 10;
		res.push_back(tmp);
	}
	return res;
}

int a[10] = { 0 };
void p()
{
	a[0] = 1;
	a[1] = 1;
	for (int i = 2; i <= 9; i++)
		a[i] = a[i - 1] * i;
}

int main()
{
	p();
	int res = 0;
	for (int i = 3; i < 10000000; i++)
	{
		int count = 0;
		vector<int> num = int_vet(i);
		for (int j = 0; j < num.size(); j++)
			count += a[num[j]];
		if (count == i)
			res += count;
	}
	cout << res << endl;

	system("pause");
	return 0;
}

转载于:https://www.cnblogs.com/wzjhoutai/p/7300798.html