Submission #4038774

---

Source Code Expand

/**
 * @brief AtCoder Regular Contest 061<br>
 * C- たくさんの数式 / Many Formulas
 *
 * bit全検索パターン
 * @see https://arc061.contest.atcoder.jp/tasks/arc061_a
 */
#include <iostream>
using namespace std;

constexpr unsigned BIT = 1;

int main() {
  string S; cin >> S;
  int len{static_cast<int>(S.size())};

  long total{};
  for (int i{}; i < (BIT << (len - 1)); ++i) {
    long temp = S[0] & 0xF;
    for (int j{}; j < len - 1; ++j) {
      if (i & (1 << j)) {
        total += temp;
        temp = 0;
      }
      temp *= 10;
      temp += S[j + 1] & 0xF;
    }
    total += temp;
  }

  cout << total << endl;
  return 0;
}

Submission Info

Judge Result