Problem 34—Digit factorials

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

LuoQuHen

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

阅读量497

点赞数

分类专栏： Project Euler 文章标签： problem34 euler digit

本文链接：https://blog.csdn.net/LuoQuHen/article/details/45200125

版权

Project Euler 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

题目描述如下：

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.

public class Problem34
{
    public static void main(String[] args)
    {
        int sum = 0;
        for (int i = 3; i < 1000000; i++)
        {
            if (isCurious(i))
            {
                System.out.println(i);
                sum += i;
            }
        }
        System.err.println("sum = " + sum);
    }

    public static boolean isCurious(int num)
    {
        int temp = num;
        int sum = 0;
        while (temp > 0)
        {
            sum += MathUtils.getFactorial(temp % 10);
            temp = temp / 10;
        }
        if (sum == num)
        {
            return true;
        }
        return false;
    }
}