Pagini recente » Cod sursa (job #381532) | Cod sursa (job #2087041) | Cod sursa (job #2813424) | Cod sursa (job #500906) | Cod sursa (job #921672)
Cod sursa(job #921672)
#include <fstream>
#include <cstring>
#define NMAX 2000001
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int i,j,n1,n2,rez[NMAX],k;
char s1[NMAX],s2[NMAX];
int main()
{
fin.get(s2,NMAX);
fin.get();
fin.get(s1,NMAX);
n1=strlen(s1);
n2=strlen(s2);
i=0;
j=-1;
while(i<=n1)
{
if(j>=0&&s1[i]!=s2[j+1])
{j=-1;i--;}
if(s1[i]==s2[j+1])
j++;
if(j+1==n2)
{rez[++k]=i-j;i--;j=-1;}
i++;
}
fout<<k<<'\n';
for(i=1;i<=k;++i)
fout<<rez[i]<<" ";
return 0;
}