Cod sursa(job #612490)
| Utilizator | Data | 8 septembrie 2011 02:25:53 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream.h>
#define N 10000000
char s[N];
long n,k,p[N],i,d,t;
int main()
{ifstream f("prefix.in");
ofstream g("prefix.out");
f>>t;
while(t--)
{f>>s;
k=p[1]=d=0;
n=strlen(s);
for(i=n;i;i--)
s[i]=s[i-1];
for(i=2;i<=n;i++)
{while(k>0&&s[k+1]!=s[i])
k=p[k];
if(s[k+1]==s[i])
k++;
p[i]=k;}
for(i=1;i<=n;i++)
if(p[i]&&i%(i-p[i])==0)
d=i;
g<<d<<"\n";}
return 0;}
