Pagini recente » Cod sursa (job #459105) | Cod sursa (job #2431901) | Cod sursa (job #650225) | Cod sursa (job #1251477) | Cod sursa (job #1738635)
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = a; i <= b; i++)
#define ROF(i,a,b) for (int i = a; i >= b; i--)
#define FOREACH(it,a) for(__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>
#define ld long double
#define ll long long
#define ull unsigned long long
const int Nmax = 1000000;
char s[Nmax+1];
int pi[Nmax+1];
int T,n;
void pi_function()
{
int k = 0;
pi[1] = 0;
FOR(i,2,n) {
while (k > 0 && s[k+1] != s[i])
k = pi[k];
if (s[k+1] == s[i])
k++;
pi[i] = k;
}
}
int main()
{
freopen("prefix.in", "r", stdin);
freopen("prefix.out", "w", stdout);
scanf("%d", &T);
FOR(t,1,T) {
scanf("%s",s+1);
n = strlen(s+1);
pi_function();
int Sol = 0;
FOR(i,2,n) {
if (pi[i] % (i - pi[i]) == 0 && pi[i] > 0)
Sol = max(i,Sol);
}
printf("%d\n",Sol);
}
}