forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
p030.java
40 lines (32 loc) · 862 Bytes
/
p030.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
* Solution to Project Euler problem 30
* By Nayuki Minase
*
* http://nayuki.eigenstate.org/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
public final class p030 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p030().run());
}
public String run() {
// As stated in the problem, 1 = 1^5 is excluded.
// If a number has at least n >= 7 digits, then even if every digit is 9,
// n * 9^5 is still less than the number (which is at least 10^n).
int sum = 0;
for (int i = 2; i < 1000000; i++) {
if (i == fifthPowerDigitSum(i))
sum += i;
}
return Integer.toString(sum);
}
private static int fifthPowerDigitSum(int x) {
int sum = 0;
while (x != 0) {
int y = x % 10;
sum += y * y * y * y * y;
x /= 10;
}
return sum;
}
}