Submission #10221918

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i < n; i++)
#define reps(i, n) for(int i=1; i <= n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()

using namespace std;
using ll=long long;

int main(){
  string S;
  cin >> S;
  int N = S.size();
  int figures[N];
  rep(i,N) figures[i] = S[i]-'0';

  ll ans=0;
  for(int tmp = 0;tmp<(1<<N-1);tmp++){
    bitset<9> s(tmp);
    //あるパターンでの和
    ll sums = 0;
    ll sump =figures[0];
    reps(i,N-1){
      if(s.test(N-1-i)){
        sums += sump;
        sump=figures[i];
      }else{
        sump = sump*10+figures[i];
      }
    }
    ans += sums+sump;
  }
  cout << ans;
}

Submission Info

Judge Result