@@ -0,0 +1,923 @@
+import java.math.BigInteger;%0A%0Apublic class P48_SelfPowers %7B%0A    // Project Euler - Problem 48 - Self powers%0A    // The series, 11 + 22 + 33 + ... + 1010 = 10405071317.%0A    // Find the last ten digits of the series, 11 + 22 + 33 + ... + 10001000.%0A%0A    public static void main(String%5B%5D args) %7B%0A        long last10 = P48_SelfPowers.findLast10();%0A        System.out.printf(%22The last ten digits of the series, 1%5E1 + 2%5E2 + 3%5E3 + ... + 1000%5E1000 = %25,d%5Cn%22, last10);%0A    %7D%0A%0A    private static long findLast10() %7B%0A        BigInteger result = new BigInteger(%220%22);%0A        for (int i = 1; i %3C= 1000; i++) %7B%0A            BigInteger power = new BigInteger(i + %22%22);%0A            power = power.pow(i);%0A            result = result.add(power);%0A        %7D%0A        String stringResult = %22%22 + result;%0A        int len = stringResult.length();%0A        String last10 = stringResult.substring(len - 10);%0A        return Long.parseLong(last10);%0A    %7D%0A%7D%0A

add solution for Euler problem 48