Pagini recente » Cod sursa (job #331869) | Cod sursa (job #339344) | Cod sursa (job #348034) | Cod sursa (job #2280588) | Cod sursa (job #2149057)
#include <fstream>
#define nmax 2000002
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s[nmax],z[nmax];
int t[nmax],sol[1002],c,k,j,m;
int main()
{
fin>>z+1;
fin>>s+1;
for(j=2;z[j]!=NULL;j++)
{
while(z[k+1]!=z[j]&&k)
k=t[k];
if(z[k+1]==z[j])
k++;
t[j]=k;
}
m=j-1;
k=0;
for(int i=1;s[i]!=NULL;i++)
{
while(z[k+1]!=s[i]&&k)
k=t[k];
if(z[k+1]==s[i])
k++;
if(k==m)
{
c++;
k=t[k];
if(c<=1000)
{
sol[c]=i-m;
}
}
}
fout<<c<<"\n";
for(int i=1;i<=min(1000,c);i++)
fout<<sol[i]<<" ";
return 0;
}