Cod sursă (job #741678)
Utilizator |
|
IP | ascuns |
---|---|---|---|
Problemă | Bart (clasele 9-10) | Compilator | cpp-32 | 0,51 kb |
Rundă | Arhiva de probleme | Status | evaluat |
Dată | 31 oct. 2023 15:24:12 | Scor | 100 |
#include <fstream>
#include <cstring>
#define MAX 500000
using namespace std;
ifstream cin ("bart.in");
ofstream cout ("bart.out");
int pi[MAX + 10];
string s;
void kmp()
{
int k = 0;
pi[0] = 0;
for (int i = 1; i < s.size(); i++)
{
while (k != 0 && s[k] != s[i])
k = pi[k - 1];
if (s[k] == s[i])
k++;
pi[i] = k;
}
}
int main()
{
cin >> s;
kmp();
for (int i = 0; i < s.size() - pi[s.size() - 1]; i++)
cout << s[i];
return 0;
}