Cod sursa(job #2500389)
| Utilizator | Data | 27 noiembrie 2019 20:03:08 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
char v[1000001];
int prefix[1000001];
int main()
{
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int t,i,j,k;
cin>>t>>ws;
for(i=0;i<t;i++)
{
cin.getline(v+1,1000001);
prefix[1]=0; k=0;
for(j=2;v[j];++j)
{
while(k>0 && v[j]!=v[k+1])
k=prefix[k];
if(v[j]==v[k+1])
++k;
prefix[j]=k;
}
j--;
while(j>0&&!(prefix[j]!=0&&j%(j-prefix[j])==0))--j;
cout<<j<<endl;
}
return 0;
}
