Pagini recente » Cod sursa (job #1585621) | Cod sursa (job #1593533) | Cod sursa (job #2807543) | Cod sursa (job #391369) | Cod sursa (job #167952)
Cod sursa(job #167952)
// aflarea de cate ori apare un subsir intr-un sir
#include <iostream.h>
#include <fstream.h>
#include <string.h>
ifstream f("strmatch.in");
ofstream g("strmatch.out");
const long max = 1000000;
char a[max],b[max];
int n,m;
void main()
{
f.getline(a,max);
f.getline(b,max);
n=strlen(a);
m=strlen(b);
char *p=b;
int i,nr=0,c[1000];
float ok;
for(i=1;(i<=m-n+1)&&(nr<1000);i++)
{
if (strncmp(a,p,n)==0)
{
nr++;
c[nr]=i-1;
}
p++;
}
g<<nr<<endl;
for(i=1;i<=nr;i++)
g<<c[i]<<" ";
}