Submission #1732687

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
string s;

int main(){
	cin >> s;
	
	ll sum=0;
	REP(i,0,(1<<s.size())){
		string pos="0";
		REP(j,0,s.size()){
			if((i>>j)&1) sum+=stoll(pos),pos="0";
			else pos+=s[j];
		}
		sum+=stoll(pos);
	}
	
	cout << sum << endl;
	return 0;
}

Submission Info

Judge Result