Pagini recente »
Clasament nu_poti_lua_0_puncte
|
lasm_22_12_2021_clasa11
|
Clasament probleme_multe
|
Rating tudose adrian (musca)
|
Cod sursă (job #532151)
Cod sursă (job
#532151)
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("bart.in");
ofstream out("bart.out");
char s[500001];
int pi[500001];
int main()
{
int i,n,poz;
in>>(s+1);
n=strlen(s+1);
for(i=2; i<=n; i++)
{
pi[i]=pi[i-1];
while(pi[i]&&s[pi[i]+1]!=s[i])
pi[i]=pi[pi[i]];
if(s[pi[i]+1]==s[i])
pi[i]++;
}
for(i=1; i<=n-pi[n]; i++)
out<<s[i];
return 0;
}