| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/JoshP/ProjectEuler-Java/master/Sol34.java | [Back] [Original] |
public class Sol34 extends BaseSolution {
int[] factorials = new int[10];
public void runSolution() {
// pre calculate factorials
for (int i = 0; i < 10; i++) {
factorials[i] = factorial(i);
}
int sum = 0;
for (int i = 10; i 0) {
//System.out.println(n % 10 + " " + factorials[n % 10]);
sum += factorials[n % 10];
n = n / 10;
}
return sum;
}
public static int factorial(int n) {
int fact = 1;
for (int i = 1; i
| Web Proxy Viewer | New URL | Original Page |