Submission #10201477

---

Source Code Expand

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

using ll =  long long;
using pint =  pair<int,int>;

#define rep(i,n) for(int (i)=0,temp=(int)(n);(i)<temp;++(i))
#define repi(i,start,end) for(int (i)=(start),temp=(int)(end);i<(end);++(i))
#define rfor(x,v) for(const auto& (x) : (v))
#define all(x) (x).begin(),(x).end()
#define SORT(v, n) sort((v), (v)+(n))
#define vsort(v) sort((v).begin(), (v).end())
#define vfsort(v,lambda) sort(all((v)),(lambda))
#define vint vector<int>
#define vvint vector<vector<int>> //vvint v(n,vint(n))
#define vin(v) rep(i,(v).size()) {cin >> (v)[i];}
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
//lambda: [&](int x, int y){return x<y;}


signed main(void){
    string s;cin>>s;
    int ans=0,n=s.length();
    
    rep(tmp,1<<n-1){
        int t=s[0]-'0';
        rep(i,n-1){
            if(tmp&(1<<i)){
                ans+=t;
                t=s[i+1]-'0';
            }else{
                t*=10;
                t+=s[i+1]-'0';
            }
        }
        ans+=t;
    }
    cout << ans << endl;
}

Submission Info

Judge Result