1354. Palindrome. Again Palindrome

1354. Palindrome. Again Palindrome

Time limit: 1.0 second Memory limit: 64 MB

A word is the nonempty sequence of symbols a₁a₂…a_n. A palindrome is the word a₁a₂…a_n that is read from the left to the right and from the right to the left the same way (a₁a₂…a_n = a_na_n−1…a₁). If S₁ = a₁a₂…a_n and S₂ = b₁b₂…b_m, then S₁S₂ = a₁a₂…a_nb₁b₂…b_m. The input contains some word S₁. You are to find a nonempty word S₂ of the minimal length that S₁S₂ is a palindrome.

Input

The first input line contains S₁ (it may consist only of the Latin letters). It’s guaranteed that the length of S₁ doesn’t exceed 10000 symbols.

Output

S₁S₂.

Samples

input	output
No	NoN
OnLine	OnLineniLnO
AbabaAab	AbabaAababA

Problem Author: Denis Nazarov Problem Source: USU Junior Championship March'2005

***************************************************************************************

kmp没想出来，用简单法做的

***************************************************************************************

#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
char  str[10011];
int n,i,j,k;
bool  judge(int x)//检查后缀的最大回文
 {
     int h,g;
     for(h=x,g=n-1;g>h;h++,g--)
       if(str[h]!=str[g])
        return false;
    return true;
 }
 int main()
 {
     scanf("%s",str);
     n=strlen(str);
     for(i=0;i<n;i++)
      cout<<str[i];
     for(i=1;i<n;i++)
      if(judge(i))
       break;
    for(j=i-1;j>=0;j--)
     cout<<str[j];
    cout<<endl;
    return 0;


 }