Problem:
Score : 300 points

Problem Statement

You are given a string S consisting of digits between 1 and 9, inclusive.
You can insert the letter + into some of the positions (possibly none) between two letters in this string.
Here, + must not occur consecutively after insertion.

All strings that can be obtained in this way can be evaluated as formulas.

Evaluate all possible formulas, and print the sum of the results.

Constraints

1 \leq |S| \leq 10

All letters in S are digits between 1 and 9, inclusive.

Input

The input is given from Standard Input in the following format:

S

Output

Print the sum of the evaluated value over all possible formulas.

Sample Input 1

125

Sample Output 1

176

There are 4 formulas that can be obtained: 125, 1+25, 12+5 and 1+2+5. When each formula is evaluated,

125

1+25=26

12+5=17

1+2+5=8

Thus, the sum is 125+26+17+8=176.

Sample Input 2

9999999999

Sample Output 2

12656242944

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
    }
    public void solve() {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        String S = scan.next();
        int length = S.length();
        char[] d = S.toCharArray();
        int limit = pow(2, length-1);
        long answer = 0;
        for (int i = 0; i < limit; i++) {
            int[] position = position(length-1, i);
            long current = 0;
            for (int j = 0; j < length; j++) {
                current *= 10;
                current += d[j] - '0';
                if (j == length - 1 || position[j] == 1) {
                    answer += current;
                    current = 0;
                }
            }
        }
        System.out.println(answer);
    }
    public int[] position(int length, int target) {
        int[] position = new int[length];
        if (target == 0) {
            return position;
        }
        int index = 0;
        while (target > 0) {
            if (target % 2 == 1) {
                position[index] = 1;
            }
            target /= 2;
            index += 1;
        }
        return position;
    }
    public int pow(int m, int n) {
        if (n == 0) {
            return 1;
        }
        if (n % 2 == 1) {
            return m*pow(m, n-1);
        }
        int x = pow(m, n/2);
        return x * x;
    }
}