Pagini recente » Cod sursa (job #1088201) | Cod sursa (job #609689) | Cod sursa (job #2558024) | Cod sursa (job #1683801) | Cod sursa (job #2911177)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("palindrom2.in");
ofstream fout("palindrom2.out");
char a[2000001], b[2000001];
int n, m, s[1001], l, p[2000001], nr;
int main()
{
fin>>a+1;
n=strlen(a+1);
l=0;
p[1]=0;
for(int i=1;i<=n;i++)
{
b[i]=a[n-i+1];
}
for(int i=2; i<=n; i++)
{
while(l!=0 && b[i]!=b[l+1])
{
l=p[l];
}
if(a[i]==a[l+1])
{
l++;
}
p[i]=l;
}
l=0;
for(int i=1; i<=n; i++)
{
while(l!=0 && a[i]!=b[l+1])
{
l=p[l];
}
if(a[i]==b[l+1])
{
l++;
}
}
// fout<<nr<<"\n";
for(int i=1; i<=n; i++)
{
fout<<a[i];
}
for(int i=l+1; i<=n; i++){fout<<b[i];}
return 0;
}