Cod sursa(job #3308906)
| Utilizator | Data | 29 august 2025 21:41:09 | |
|---|---|---|---|
| Problema | Prefix | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
#include <string>
using namespace std;
ifstream cin("prefix.in");
ofstream cout("prefix.out");
int t, indx, p[1000005];
string s;
int main()
{
cin>>t;
while(t--){
indx=0;
cin>>s;
s='$'+s;
int n=s.size()-1;
p[1]=0;
for(int i=2; i<=n; i++){
int aux=p[i-1];
while(aux && s[aux+1]!=s[i])
aux=p[aux];
p[i]=aux;
if(s[i]==s[aux+1])
p[i]++;
int x=i-p[i];
if(x!=i && i%x==0)
indx=i;
}
cout<<indx<<'\n';
}
return 0;
}
