Pagini recente » Cod sursa (job #1045673) | Cod sursa (job #168346) | Cod sursa (job #116847) | Cod sursa (job #1574577) | Cod sursa (job #3005592)
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
int tata[2000008],lg1,lg2,i2,i,aux,cnt;
char cuv1[2000008],cuv2[2000008];
vector<int>ras;
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fin>>cuv1+1;
lg1=strlen(cuv1+1);
fin>>cuv2+1;
lg2=strlen(cuv2+1);
tata[1]=0;
for(i=2;i<=lg1;i++)
{
i2=i-1;
while(cuv1[tata[i2]+1]!=cuv1[i] && i2!=0)
{
i2=tata[i2];
}
if(cuv1[tata[i2]+1]==cuv1[i])
tata[i]=tata[i2]+1;
else
tata[i]=0;
}
aux=0;
for(i=1;i<=lg2;i++)
{
while(cuv1[aux+1]!=cuv2[i] && aux!=0)
{
aux=tata[aux];
}
if(cuv1[aux+1]==cuv2[i])
{
aux=aux+1;
}
if(aux>=lg1)
{
cnt++;
if(cnt<=1000)
ras.push_back(i-lg1);
}
}
fout<<cnt<<'\n';
for(auto i: ras)
{
fout<<i<<" ";
}
return 0;
}