Submission #3598196

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<map>
using namespace std;
#define REP(i, limit) for(int i=0; i< limit; ++i)
#define LL long long

LL baai(int x){
  if(x==0) return 1;
  LL r=1;
  REP(i, x-1) r*=2;
  return r;
}

int main(){
  string s;
  cin>>s;
  int n=s.size();
  if(n==1){
    cout<<s<<endl;
    return 0;
  }

  LL ans=0;
  for(int i=1; i<=n; ++i){
    for(int j=0; j<n-i+1; ++j){
      ans += stoll(s.substr(j, i)) * baai(j) * baai(n-i-j);
      //cout<<stoll(s.substr(j, i))<<" "<<ans<<endl;;
    }
  }
  cout<<ans<<endl;




  return 0;
}

Submission Info

Judge Result