1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <iomanip>
#include<iostream> 
#include<string.h>
#include<fstream>
#include<sstream>
#include<math.h>
using namespace std; 
char a[500001];
//void quickSort(int aa[][3],int,int);  
int main(void)
{
    int len,i,j,ans;
    cin>>a;
    len=strlen(a);
    i=0;
    j=len-1;
    ans=0;
    while(i<=j)
    {
        if(i==ans)i++;
        if(j==ans)j--;
        if(a[i]==a[j])
        {
            i++;
            j--;
        }
        else
        {
            i=0;
            j=len-1;
            ans++;
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX