Submission #10217908


Source Code Expand

#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int MOD = 1E9 + 9;
const int INF = 1 << 29;

int main() {
  string S;
  cin >> S;
  int l = S.length() - 1;
  long ans = 0;
  for (int bit = 0; bit < (1 << l); ++bit) {
    vector<int> ix;
    for (int i = 0; i < l; ++i) {
      if (bit & (1 << i)) ix.push_back(i);
    }
    int begin = 0;
    for (int i = 0; i < ix.size(); ++i) {
      ans += stol(S.substr(begin, ix[i] + 1 - begin));
      begin = ix[i] + 1;
    }
    ans += stol(S.substr(begin));
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Many Formulas
User yokotani
Language C++14 (GCC 5.4.1)
Score 300
Code Size 701 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status AC
AC × 12
Set Name Test Cases
Sample
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
01.txt AC 2 ms 256 KB
02.txt AC 2 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 2 ms 256 KB
08.txt AC 2 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 2 ms 256 KB