Pagini recente » Cod sursa (job #2043633) | Cod sursa (job #515477) | Cod sursa (job #894209) | Cod sursa (job #2532962) | Cod sursa (job #991157)
Cod sursa(job #991157)
#include <fstream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000001],b[2000001];
long long i,j,k,n1,n2,nr,p,ok,d[2000001];
int main()
{
while (a[n1]!='\n')
{ n1++;
f>>noskipws>>a[n1];
}
n1--;
while (b[n2]!='\n')
{ n2++;
f>>noskipws>>b[n2];
}
n2--;
for (i=1;i<=n2-n1+2;i++)
{
if (b[i]==a[1])
{
ok=1;
for (j=2;j<=n1;j++ && ok==1)
if (a[j]!=b[i+j-1])
ok=0;
if(ok==1){nr++;d[nr]=i-1;}
}
}
g<<nr<<'\n';
for(i=1;i<=nr;i++)g<<d[i]<<" ";
f.close();
g.close();
}