Submission #7425849

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <unordered_map>
#include <stack>

using namespace std;

long long MOD = 1e9 + 7;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    std::string s;
    cin >> s;

    long long sum = 0;
    for (size_t bit = 0; bit < (1 << (s.size() - 1)); bit++)
    {
        long long thisNum = s[0] - '0';
        long long thisSum = 0;
        for (size_t i = 0; i < s.size() - 1; i++)
        {
            // bitが立っている数字から新しい区切りとする
            if (bit & (1 << i)) {
                thisSum += thisNum;
                //std::cout << thisNum << " ";
                thisNum = s[i + 1] - '0';
            }
            else {
                // bitが立っていない場合、位をあげて次を足す
                thisNum = thisNum * 10 + (s[i + 1] - '0');
            }
        }
        //std::cout << thisNum << std::endl;
        thisSum += thisNum;
        sum += thisSum;
    }
    std::cout << sum << std::endl;
    return 0;
}

Submission Info

Judge Result