Pagini recente » Cod sursa (job #154181) | Cod sursa (job #2316333) | Cod sursa (job #2848573) | Cod sursa (job #1247387) | Cod sursa (job #1405097)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream fin("prefix.in");
ofstream fout("prefix.out");
vector<int> prefixFunction(string& s)
{
int n = s.size();
vector<int> pi(n);
for (int i = 1; i < n; ++i)
{
int j = pi[i - 1];
while (j > 0 && s[i] != s[j])
j = pi[j - 1];
if (s[i] == s[j])
++j;
pi[i] = j;
}
return pi;
}
int main()
{
int t = 0; fin >> t;
while (t--)
{
string s;
fin >> s;
vector<int> pi = prefixFunction(s);
int res = 0;
for (int i = pi.size(); i > 0; --i)
{
if (pi[i - 1] && i % (i - pi[i - 1]) == 0)
{
res = i;
break;
}
}
fout << res << '\n';
}
return 0;
}