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 C# (Mono 4.6.2.0) (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace TestApp2
{
    class Program
    {
        static void Main(string[] args)
        {
            var str = Console.ReadLine();
            var strar = str.Select(_ => int.Parse(_.ToString())).ToList();
            var len = str.Length;
            var bits = new List<List<bool>>();
            var x = CreateBits(bits, len - 1,0);
            var valls = new List<long>();
            foreach (var item in x)
            {
                var count = bits.Count;
                long val = 0;
                var before = "";
                for (int i = 0; i < len; i++)
                {
                    if (i < len - 1)
                    {
                        if (item[i])
                        {
                            before += strar[i];
                        }
                        else
                        {
                            before += strar[i];
                            val += long.Parse(before);
                            before = "";
                        }
                    }
                    else
                    {
                        if (before == "")
                            val += strar[i];
                        else
                        {
                            val += long.Parse((before + strar[i]));
                        }
                    }
                }
                valls.Add(val);
            }

            Console.WriteLine(valls.Sum());
            Console.ReadLine();

        }

        private static List<List<bool>> CreateBits(List<List<bool>> bits, int len, int count)
        {
            if (count == 0)
            {
                var lss = new List<bool>();
                lss.Add(true);
                bits.Add(lss);
                var lx = new List<bool>();
                lx.Add(false);
                bits.Add(lx);
                count++;
                return CreateBits(bits, len, count);
            }
            if (len - count == 0)
                return bits;
            count++;
            var ls = new List<List<bool>>();
            foreach (var item in bits)
            {
                var x = item.ToList();
                x.Add(true);
                item.Add(false);
                ls.Add(item);
                ls.Add(x);
            }
             return CreateBits(ls, len, count);
        }
    }
}