Submission #10215975


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cmath>

using namespace std;
typedef long long ll;

int main(){
  string S;
  cin >> S;
  vector<ll> digits;
  for (ll i=0; i<S.size(); i++){
    digits.push_back(atoi(S.substr(i, 1).c_str()));
  }
  ll ans = 0;
  ll buf = 0;
  for (ll i=0; i<pow(2, S.size()-1); i++){
    vector<bool> flags;
    buf = 0;
    ll itmp = i;
    for (ll j=0; j<S.size()-1; j++){
      flags.push_back(itmp % 2 == 1);
      itmp = itmp / 2;
      cerr << flags.back() << " ";
    }
    cerr << endl;
    buf = digits[0];
    for (ll j=1; j<S.size(); j++){
      if (flags[j-1]){
        ans += buf;
        buf = digits[j];
      }
      else{
        buf = 10 * buf + digits[j];
      }
    }
    ans += buf;
    cerr << ans << endl;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Many Formulas
User u271969h
Language C++14 (GCC 5.4.1)
Score 300
Code Size 863 Byte
Status AC
Exec Time 6 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 6 ms 256 KB
02.txt AC 6 ms 256 KB
03.txt AC 6 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 2 ms 256 KB
07.txt AC 6 ms 256 KB
08.txt AC 6 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 6 ms 256 KB