Submission #3666019

---

Source Code Expand

//cod2017th_b.cpp
//Sun Nov 25 14:26:28 2018

#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;

int main(){
	string s;
	cin >> s;

	int ans = 0;
	string wild = "#";
	string ss = s;
	while (1){
		int start = 0;
		int end = ss.length()-1;
		int flag = 1;
		while (start<end){
			if (ss[start] != ss[end] && ss[end] != '#'){
				flag = 0;
				break;
			}
			start++;
			end--;
		}
		if (flag == 1){
			cout << ans << endl;
			return 0;
		}
		ss = ss + wild;
//		cout << ans << endl;
		ans++;
	}


}

Submission Info

Judge Result