Pagini recente »
Concurs clasa a 9-a
|
Istoria paginii runda/2024-08-19-clasa-6-tema-1
|
Istoria paginii runda/2020-02-20-clasa-7-tema-23
|
Cod sursă (job #692282)
|
Cod sursă (job #676704)
Cod sursă (job
#676704)
#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");
string a;
int pi[500005];
string s;
int main()
{
in >> a;
int n = a.size();
/*
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]++;
}
s.resize(n - pi[n - 1]);
for (int i = 0; i < s.size(); i++)
s[i] = a[i];
*/
//out << s;
return 0;
}