Pagini recente » Cod sursa (job #1150479) | Cod sursa (job #3234236) | Cod sursa (job #1908597) | Cod sursa (job #2805202) | Cod sursa (job #2408794)
#include<fstream>
#include<string.h>
#include<iostream>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int n,m,i,j,poz[2000005],contor,ok;
char a[2000005],b[2000005];
int main()
{
fin>>a;
fin.get();
fin>>b;
fin.get();
n=strlen(a);
m=strlen(b);
contor=0;
for(i=0;i<=m-n;i++)
if(b[i]==a[0])
{
ok=1;
for(j=i;j<=i+n-1;j++)
if(b[j]!=a[j-i])
{
ok=0;
break;
}
if(ok==1)
{
contor++;
if(contor<=1000)
poz[contor]=i;
}
}
fout<<contor<<"\n";
for(i=1;i<=contor && i<=1000;i++)
fout<<poz[i]<<" ";
fin.close();
fout.close();
return 0;
}