Pagini recente » Cod sursa (job #472330) | Cod sursa (job #1598231) | Cod sursa (job #1143122) | Cod sursa (job #1110993) | Cod sursa (job #2736037)
#include <fstream>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int main()
{
int t; f >> t;
while (t--)
{
string s; f >> s;
int n = s.size();
int* p = new int[n + 1];
p[0] = 0;
int ans = 0;
int k = 0;
for (int i = 1; i < n; i++)
{
while (k > 0 && s[i] != s[k])
k = p[k - 1];
if (s[i] == s[k])
k++;
p[i] = k;
if (k && (i + 1) % (i + 1 - k) == 0)
ans = i + 1;
}
g << ans << "\n";
delete[] p;
}
return 0;
}