Pagini recente » Cod sursa (job #345537) | Cod sursa (job #2391507) | Cod sursa (job #367817) | Cod sursa (job #832513) | Cod sursa (job #2460573)
#include <iostream>
#include <fstream>
#include <cstring>
#define NMAX 10000000
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int t, phi[NMAX+10];
char s[NMAX+10];
int main()
{
f >> t;
while(t--)
{ f >> s;
memset(phi, 0, sizeof(phi));
int i=1, j=0;
int n = strlen(s);
while(i < n)
{ if(s[i] == s[j])
{ j++;
phi[i] = j;
i++;
}
else
{ if(j) j = phi[j-1];
else i++;
}
}
//for(int i=0; i<strlen(s); i++) cout << phi[i] << ' ';
//cout << '\n';
bool ok = 0;
for(int i=n-1; i>=0 && !ok; i--)
if(phi[i] && phi[i] % (i + 1 - phi[i]) == 0) g << i+1 << '\n', ok = 1;
if(!ok) g << 0 << '\n';
}
return 0;
}