Submission #1229318

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

string s;
ll ans = 0;
void dfs(int pos, int cnt, ll total, int prev) {
    if (pos == s.size()) {
        if (cnt == 0) {
            ll num = atol(s.substr(prev, pos - prev).c_str());
            total += num;
            ans += total;
        }
        return ;
    }
    
    if (cnt > 0) {
        ll num = atol(s.substr(prev, pos - prev).c_str());
        dfs(pos + 1, cnt - 1, total + num, pos);
    }
    dfs(pos + 1, cnt, total, prev);
}

int main() {
    cin >> s;
    //dfs(1, 1, 0, 0);
    for (int i = 0; i < s.size(); i++) {
        dfs(1, i, 0, 0);
    }
    
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result