Submission #4045581

---

Source Code Expand

#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define ABS(a,b) max(a,b) - min(a,b)

string s;
ll ans = 0;
int main() {
	cin >> s;
	REP(i,1<<s.size() - 1){
		ll now = s[0] - '0';
		REP(j, s.size() - 1) {
			if (i & (1 << j)) {
				ans += now;
				now = s[j + 1] - '0';

			}
			else now = now * 10 + s[j + 1] - '0';
		}
		ans += now;
	}
	cout << ans << endl;
}	

Submission Info

Judge Result