Cod sursa(job #2559267)
| Utilizator | Data | 27 februarie 2020 10:33:55 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<fstream>
#include<string.h>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
char s[1000001];
int pi[1000001];
int main()
{
int n,i,now,t,j,x;
in>>t;
for(j=1;j<=t;j++)
{
in>>s+1;
x=0;
n=strlen(s+1);
for(i=2;i<=n;i++)
{
now=pi[i-1];
while(now>0&&s[now+1]!=s[i])
now=pi[now];
if(s[now+1]==s[i])
now++;
pi[i]=now;
if(pi[i]!=0&&i%(i-pi[i])==0)
x=i;
}
out<<x<<'\n';
}
return 0;
}
