Submission #4061802

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <queue>

using namespace std;
typedef long long ll;

int main(){
    string str;
    int n;
    ll A[10];
    cin>>str;
    n = str.length();
    for(int i = 0;i < n;i++){
        A[i] = (int)(str[i]-'0');
    }
    ll ret = 0;
    for(int sig = 0;sig < (1<<(n-1));sig++){
        ll sum = 0;
        int digit = 1;
        for (int i = 0;i < n-1;i++){
            sum += digit * A[n-1-i];
            if((sig&(1<<i))==0){
                digit *=10;
            }else{
                digit = 1;
            }
        }
        sum += digit * A[0];
        ret += sum;
    }
    cout<<ret<<endl;
}

Submission Info

Judge Result