Pagini recente »
ojigim
|
Istoria paginii runda/2021-04-27-clasa-5-tema-27
|
Istoria paginii runda/2024-08-30-clasa-6-tema-6
|
Istoria paginii runda/c1_oni_9/clasament
|
Cod sursă (job #696226)
Cod sursă (job
#696226)
#include <fstream>
using namespace std;
ifstream cin ("bart.in");
ofstream cout ("bart.out");
char v[500010];
int pi[500010];
int main()
{
int n,i;
char ch;
n=0;
while (cin>>ch)
{
n++;
v[n]=ch;
}
for (i=2; i<=n; i++)
{
pi[i]=pi[i-1];
while (pi[i]!=0 && v[pi[i]+1]!=v[i])
pi[i]=pi[pi[i]];
if (v[pi[i]+1]==v[i])
pi[i]++;
}
for (i=1; i<=n-pi[n]; i++)
cout<<v[i];
return 0;
}