Pagini recente » Cod sursa (job #1195013) | Cod sursa (job #244238) | Cod sursa (job #1930443) | Cod sursa (job #1804641) | Cod sursa (job #2417112)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n,m,i,l,p[2000010],s[1001],cnt,sol;
char a[2000010],b[2000010];
int main(){
fin>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
l=0;
for(i=2;i<=n;i++){
while(l!=0 && a[i]!=a[l+1])
l=p[l];
if(a[i]==a[l+1])
l++;
p[i]=l;
}
l=0;
for(i=1;i<=m;i++){
while(l!=0 && b[i]!=a[l+1])
l=p[l];
if(b[i]==a[l+1])
l++;
if(l==n){
sol++;
if(cnt<1000)
s[++cnt]=i-n;
}
}
fout<<sol<<"\n";
for(i=1;i<=cnt;i++)
fout<<s[i]<<" ";
return 0;
}