Pagini recente »
Borderou de evaluare (job #387788)
|
Borderou de evaluare (job #256952)
|
Borderou de evaluare (job #604906)
|
Borderou de evaluare (job #204034)
|
Cod sursă (job #709903)
Cod sursă (job
#709903)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bart.in");
ofstream fout("bart.out");
vector<int> pi;
int main()
{
string s;
fin>>s;
int i,n=s.size(),k;
pi.resize(n+1);
for(i=1;i<n;i++)
{
k=pi[i-1];
while(k && s[i]!=s[k])
k=pi[k-1];
if(s[i]==s[k])
k++;
pi[i]=k;
}
for(i=0;i<n-pi[n-1];i++)
fout<<s[i];
return 0;
}