Pagini recente » Cod sursa (job #272031) | Rating Moldovan George (gmoldoo56) | Cod sursa (job #2904124) | Cod sursa (job #984557) | Cod sursa (job #974468)
Cod sursa(job #974468)
#include<fstream>
#include<cstring>
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
int m,n,p[10001],a[10001],sol,i,j,k;
char s[10001],c;
int main()
{
f>>n;
f.getline(s,10001);
for(i=1;i<=n;i++)
{
f.getline(s,10001);
m=strlen(s);
for(j=m;j>0;j--)
s[j]=s[j-1];
p[1]=0;
for(k=0,j=2;j<=m;j++)
{
// k=0;
while(k&&s[k+1]!=s[j])
k=p[k];
if(s[k+1]==s[j])
k++;
p[j]=k;
}
sol=0;
for(j=1;j<=m;j++)
if((j-p[j]==p[j])||(j-p[j]==p[j]-p[p[j]]&&a[p[j]]))
{
a[j]=1;
sol=j;
}
else
a[j]=0;
g<<sol<<"\n";
}
return 0;
}