Submission #3182241

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main(int argc, char const *argv[]) {
  int n;
  string s;
  cin >> n >> s;
  vector<string> vec;
  vec.push_back({'b'});
  for (int i = 1; i <= n; i++) {
    string temp = vec[vec.size()-1];
    temp.push_back('c');
    temp.insert(temp.begin() + 0, 'a');
    vec.push_back(temp);
    temp.push_back('a');
    temp.insert(temp.begin() + 0, 'c');
    vec.push_back(temp);
    temp.push_back('b');
    temp.insert(temp.begin() + 0, 'b');
    vec.push_back(temp);
  }
  auto itr = std::find(vec.begin(), vec.end(), s);
  size_t index = std::distance( vec.begin(), itr );
  if (index != vec.size()) cout << index << endl;
  else cout << -1 << endl;
  return 0;
}

Submission Info

Judge Result