Pagini recente » Cod sursa (job #1228600) | Cod sursa (job #1212404) | Cod sursa (job #191302) | Cod sursa (job #1519312) | Cod sursa (job #991158)
Cod sursa(job #991158)
#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,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])
{
for (j=2;j<=n1;j++)
if (a[j]!=b[i+j-1])
break;
if(j==n1+1){nr++;d[nr]=i-1;}
}
}
g<<nr<<'\n';
for(i=1;i<=nr;i++)g<<d[i]<<" ";
f.close();
g.close();
}