Pagini recente » Cod sursa (job #1282965) | Cod sursa (job #878143) | Cod sursa (job #2688339) | Cod sursa (job #1498037) | Cod sursa (job #1817771)
#include <stdio.h>
#include <stdlib.h>
#define BUF_SIZE 1<<17
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
if(pbuf==BUF_SIZE){
fread(buf, BUF_SIZE, 1, fi);
pbuf=0;
}
return buf[pbuf++];
}
inline long long nextnum(){
long long a=0;
char c=nextch();
while((c<'0' || c>'9') && c!='-')
c=nextch();
int semn=1;
if(c=='-'){
semn=-1;
c=nextch();
}
while('0'<=c && c<='9'){
a=a*10+c-'0';
c=nextch();
}
return a*semn;
}
int m;
char M[1000001];
int pi[1000001];
inline void makePi(){
pi[1]=0;
int k=0;
int ans=0;
for(int i=2;i<=m;i++){
while(k>0 && M[k+1]!=M[i])
k=pi[k];
if(M[k+1]==M[i])
k++;
pi[i]=k;
if(pi[i] && i%(i-pi[i])==0)
ans=i;
}
fprintf(fo,"%d\n", ans);
}
int main(){
fi=fopen("prefix.in","r");
fo=fopen("prefix.out","w");
int t=nextnum();
//fscanf(fi,"%d", &t);
for(int z=0;z<t;z++){
char c=nextch();
while(c<'a' || c>'z')
c=nextch();
m=0;
while(c>='a' && c<='z'){
M[++m]=c;
c=nextch();
}
makePi();
}
fclose(fi);
fclose(fo);
return 0;
}