Submission #400483

---

Source Code Expand

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define Whole(xs) xs.begin(), xs.end()

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
    if (vs.empty()) return os << "[]";
    os << "[" << vs[0];
    for (int i = 0; i < vs.size(); i++) os << " " << vs[i];
    return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

int N;
string S;
void Input() {
    cin >> N >> S;
}

void Solve() {
    string I = "b";
    if (I == S) {
        cout << 0 << endl;
        return;
    }
    for (int i = 1; i <= 300; i++) {
        if (i % 3 == 1) {
            I = "a" + I + "c";
        } else if (i % 3 == 2) {
            I = "c" + I + "a";
        } else {
            I = "b" + I + "b";
        }
        if (I == S) {
            cout << i << endl;
            return;
        }
    }
    cout << -1 << endl;
}

int main() {
    Input(); Solve();
    return 0;
}

Submission Info

Judge Result