Submission #3209520

---

Source Code Expand

#include<stdio.h>
#include<iostream>
#include<string>
#include<math.h>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#include<time.h>
#include<ctime>
#include<functional>
#define int long long
#define INT INT_MAX
#define LONG LLONG_MAX
#define f(i,n) for(int i=0;i<(n);i++)
#define P pair<int,int>
typedef long long ll;
using namespace std;

ll GCD(ll a, ll b) {
	if (b == 0)return a;
	return GCD(b, a%b);
}

ll LCM(ll a, ll b) {
	return a / GCD(a, b)*b;
}

ll mypow(ll a, ll b, ll c) {
	if (b == 0)return 1;
	if (b % 2)return mypow(a, b - 1, c)*a%c;
	else return mypow(a, b / 2, c)*mypow(a, b / 2, c) % c;
}

signed main() {
	int a;
	string s;
	cin >> a >> s;
	int b = (a - 1) / 2;
	if (a % 2) {
		for (int i = b; i >= 0; i--) {
			if ((i % 3 == 0&& (s[b - i] != 'b' || s[b + i] != 'b'))|| (i % 3 == 1 && (s[b - i] != 'a' || s[b + i] != 'c'))||(i%3==2&&(s[b-i]!='c'||s[b+i]!='a'))) {
				puts("-1");
				return 0;
			}
		}
		cout << b << endl;
	}
	else puts("-1");
	getchar();
	getchar();
	return 0;
}

Submission Info

Judge Result