回文

#include <iostream>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;


int main()
{

    char str[100];
    int result[100];
    int result2[100];

    while(gets(str))
    {
        memset(result, 0, sizeof(result));
        memset(result2, 0, sizeof(result2));
        int len = strlen(str);

        //形如aba
        for(int i = 1; i < len; ++i)
        {
            for(int j = 1; j < i; j++)
            {
                if(str[i-j] == str[i+j])
                {
                    result[i]++;
                }
                else
                {
                    //一定要break
                    break;
                }
            }
        }

        //形如abba
        for(int i = 1; i < len; ++i)
        {
            for(int j = 0; j < i; j++)
            {
                if(str[i-j] == str[i+j+1])
                {
                    result2[i]++;
                }
                else
                {
                    break;
                }
            }
        }



        int max_num = 0;
        int index = 0;
        int flag = 0;

        for(int i = 0; i < len; ++i)
        {
            if(result[i] > max_num)
            {
                index = i;
                max_num = result[i];
                flag = 1;
            }
        }

        for(int i = 0; i < len; ++i)
        {
            if(result2[i] > max_num)
            {
                index = i;
                max_num = result2[i];
                flag = 2;
            }
        }


        if(flag == 1)
        {
            for(int i = 0; i< 2*max_num+1; i++)
            {
                cout<<str[index-max_num+i];
            }
            cout<<endl;
        }
        else
        {
            for(int i = 0; i< 2*max_num; i++)
            {
                cout<<str[index-max_num+i+1];
            }
            cout<<endl;
        }


    }

    return 0;
}