Cod sursa(job #2479364)
| Utilizator | Data | 23 octombrie 2019 18:42:55 | |
|---|---|---|---|
| Problema | Potrivirea sirurilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
char s[4000005];
int kmp[4000005];
int main()
{
int n,m,i,nr=0,x,afis=0;
cin>>s+1;
n=strlen(s+1);
s[n+1]='?';///oh yee
cin>>s+n+2;
m=strlen(s+1);
for(i=2;i<=m;i++)
{
x=kmp[i-1];
while(s[i]!=s[x+1] && x>0)
x=kmp[x];
if(s[i]==s[x+1])
kmp[i]=x+1;
if(i>=n+2 && kmp[i]==n)
nr++;
}
cout<<nr<<'\n';
for(i=n+2;i<=m && afis<1000;i++)
if(kmp[i]==n)
cout<<i-n-1-n<<" ";
return 0;
}
