Cod sursa(job #2391798)
| Utilizator | Data | 29 martie 2019 11:25:59 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <bits/stdc++.h>
#define dim 1000005
using namespace std;
ifstream f("prefix.in");
ofstream g("prefix.out");
char s[dim];
int n,pi[dim],ans;
void MakePrefix()
{
int q=0;
pi[1]=0;
for(int i=2;i<=n;++i)
{
while(q&&s[q+1]!=s[i])
q=pi[q];
if(s[q+1]==s[i])++q;
pi[i]=q;
}
}
void Solve()
{
f>>(s+1);
n=strlen(s+1);
ans=0;
MakePrefix();
for(int i=n;i>=2;--i)
if(pi[i]!=0&&i%(i-pi[i])==0)
{
ans=i;
break;
}
g<<ans<<'\n';
}
int main()
{
int test;
f>>test;
while(test--)
Solve();
return 0;
}
