[Euler]Problem 30 - Digit fifth powers

最新推荐文章于 2021-07-05 15:28:37 发布

原创最新推荐文章于 2021-07-05 15:28:37 发布 · 943 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#Euler

Euler 专栏收录该内容

3 篇文章

订阅专栏

本文探讨了一类特殊的整数，这些整数等于其各位数字五次方之和。通过编写Java程序来找出所有符合条件的整数，并计算它们的总和。结果显示，满足条件的整数共有8个，其总和为443839。

Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:

1634 = 1⁴ + 6⁴ + 3⁴ + 4⁴
8208 = 8⁴ + 2⁴ + 0⁴ + 8⁴
9474 = 9⁴ + 4⁴ + 7⁴ + 4⁴

As 1 = 1⁴ is not a sum it is not included.

The sum of these numbers is 1634 + 8208 + 9474 = 19316.

Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.

import java.util.HashMap;
import java.util.Map;

public class DigitFifthPowers {
	Map<Integer, Double> map = new HashMap<Integer, Double>();

	public static void main(String[] args) {
		long before = System.currentTimeMillis();

		new DigitFifthPowers().calculate();

		System.out.println("elapsed time is : " + (System.currentTimeMillis() - before));
	}

	private void calculate() {
		int count = 0;

		for (int i = 0; i < 10; i++) {
			map.put(i, Math.pow(i, 5));
		}

		System.out.print("the numbers that can be written as the sum of fifth powers of their digits is : ");

		for (int i = 2; i < 1000000; i++) {
			if (isThisIt(i)) {
				System.out.print(i + " ");
				count += i;
			}
		}

		System.out.println();
		System.out.println(count);
	}

	private boolean isThisIt(int i) {
		Double sumOfDigits = 0d;
		int temp = i;

		while (temp > 0) {
			sumOfDigits += map.get(temp % 10);
			temp /= 10;
		}

		return sumOfDigits == i;
	}

}

console:

the numbers that can be written as the sum of fifth powers of their digits is : 4150 4151 54748 92727 93084 194979 
443839
elapsed time is : 111