Pagini recente »
2018-02-01-clasa-5-tema-24
|
Atașamentele paginii 2024-10-21-clasa-6-tema-12
|
Atașamentele paginii Clasament 2021-12-15-clasa-5-tema-20-optionala
|
Istoria paginii runda/2019-09-26-clasa-7-tema-2-optionala
|
Cod sursă (job #676698)
Cod sursă (job
#676698)
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("O4")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
ifstream in("bart.in");
ofstream out("bart.out");
char a[500005];
int pi[500005];
int main()
{
in.getline(a,500003);
int n = strlen(a);
for (int i = 1; i < n; i++)
{
pi[i] = pi[i - 1];
while (pi[i] != 0 and a[pi[i]] != a[i])
pi[i] = pi[pi[i]];
if (a[i] == a[pi[i]])
pi[i]++;
}
int lg = n - pi[n - 1];
for (int i = 0; i < lg; i++)
out << a[i];
return 0;
}