Pagini recente » Cod sursa (job #1041483) | Cod sursa (job #2393318) | Cod sursa (job #2963025) | Cod sursa (job #8981) | Cod sursa (job #2331743)
#include <fstream>
#define nm 2000003
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s[nm],x[nm];
int t[nm],sol[1002];
int k,j,c;
int main()
{
fin>>x+1;
fin>>s+1;
for(j=2;x[j]!=NULL;j++)
{
while(x[k+1]!=x[j]&&k)
k=t[k];
if(x[k+1]==x[j])
k++;
t[j]=k;
}
k=0;
for(int i=1;s[i]!=NULL;i++)
{
while(x[k+1]!=s[i]&&k)
k=t[k];
if(x[k+1]==s[i])
k++;
if(k==j-1)
{
c++;
if(c<=1000)
{
sol[c]=i-k;
}
k=t[k];
}
}
fout<<c<<"\n";
for(int i=1;i<=min(c,1000);i++)
fout<<sol[i]<<" ";
return 0;
}