Submission #400478

---

Source Code Expand

#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

int solve(string &o){
  string s = "b";
  REP(i, 100){
    if(i % 3 == 0) s = "a" + s + "c";
    if(i % 3 == 1) s = "c" + s + "a";
    if(i % 3 == 2) s = "b" + s + "b";
    if(s == o) return i + 1;
  }
  return -1;
}

int main() {
  int N; cin >>N;
  string s; cin >>s;
  cout <<solve(s) <<endl;
  return 0;
}

Submission Info

Judge Result