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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>

using namespace std;

typedef long long int ll;

#define all(x) x.begin(),x.end()

const ll mod = 1e9+7;
const ll INF = 1e9;
const ll MAXN = 1e9;

int main()
{
    string s;
    cin >> s;

    int n = s.size()-1;
    ll sol = 0;
    for(int bit = 0; bit < (1<<n); bit++){
        ll now = 0;
        //cout << bitset<8>(bit) << endl;
        for(int i = 0; i < n+1; i++){
            now *= 10;
            now += s[i] - '0';
            if(!(bit&(1<<i))){  //bitが立ってない -> +があるので加算   bitが立ってる -> +がない
                //cout << bitset<8>(bit&(1<<i)) << endl;
                //cout << now << endl;
                sol += now;
                now = 0;
            }
        }
    }

    cout << sol << endl;

    return 0;
}