Pagini recente » Cod sursa (job #2917072) | Cod sursa (job #2377134) | Cod sursa (job #1982723) | Cod sursa (job #685999) | Cod sursa (job #2673493)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s1[2000005],s2[2000005];
int prefix[2000005],ans[1009],k,j;
int main()
{
fin.getline(s1,2000005);
fin.getline(s2,2000005);
j=0;
for(int i=1;i<strlen(s1);i++)
{
while(s1[j]!=s1[i]&&j>0)
j=prefix[j-1];
if(s1[i]==s1[j])
j++;
prefix[i]=j;
}
prefix[0]=0;
j=0;
for(int i=0;i<strlen(s2);i++)
{
while(s1[j]!=s2[i]&&j>0)
j=prefix[j-1];
if(s1[j]==s2[i])
j++;
if(j==strlen(s1))
{
k++
if(k<=1000)
ans[k]=i-j+1;
}
}
fout<<k<<'\n';
if(k>1000)
k=1000;
for(int i=1;i<=k;i++)
fout<<ans[i]<<' ';
}