Pagini recente » Cod sursa (job #3165478) | Cod sursa (job #2311797) | Cod sursa (job #1929240) | Cod sursa (job #2190574) | Cod sursa (job #2371586)
#include<fstream>
#include<cstring>
using namespace std;
ifstream f ("strmatch.in");
ofstream g ("strmatch.out");
char a[2000010],b[2000010];
int n,m,tipar[2000010],sol[2000010],nr;
int main()
{
f.getline(a,2000010);
f.getline(b,2000010);
n=strlen(a);
m=strlen(b);
if(n>m){
g<<0;
return 0;
}
tipar[0]=0;
int j=0;
for(int i=1;i<n;++i){
if(a[i]==a[j]){
tipar[i]=j+1;
++j;
}
else{
while(j>0&&a[j]!=a[i]){
j=tipar[j-1];
}
if(a[i]==a[j]){
tipar[i]=j+1;
++j;
}
}
}
j=0;
for(int i=0;i<m;++i){
if(b[i]==a[j]) ++j;
else{
while(j>0&&a[j]!=b[i]){
j=tipar[j-1];
}
if(b[i]==a[j]){
++j;
}
}
if(j==n) sol[++nr]=i-j+1;
}
g<<nr<<'\n';
for(int i=1;i<=nr;++i)
if(i>1000) break;
else g<<sol[i]<<" ";
return 0;
}