Pagini recente » Cod sursa (job #1414973) | Cod sursa (job #2403333) | Cod sursa (job #1864720) | Cod sursa (job #2039221) | Cod sursa (job #2932196)
#include<fstream>
#include<cstring>
//#include<iostream>
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
int urm[2000001];
char t[20000001],P[20000001];
int n,m;
void urmatorul(char *p)
{
int k=-1,x;
urm[0]=0;
for(x=1;x<m;x++)
{
while(k>0&&p[k+1]!=p[x])
k=urm[k];
if(p[k+1]==p[x]) k++;
urm[x]=k;
}
}
int poz[1002];
int main() {
int i,x=-1,p1=0;
cin.getline(P,2000002);
cin.getline(t,2000002);
n=strlen(t);
m=strlen(P);
urmatorul(P);
for(i=0;i<n;i++)
{
while(x>0&&P[x+1]!=t[i])x=urm[x];
if(P[x+1]==t[i])x++;
if(x==m-1)
{
p1++;
if(p1<=1000)
poz[p1]=i-m+1;
x=urm[x];
}
}
cout<<p1<<'\n';
if(p1>1000)
p1=1000;
for(i=1;i<=p1;i++)
cout<<poz[i]<<' ';
}