Pagini recente » Cod sursa (job #356531) | Cod sursa (job #2882449) | Cod sursa (job #1804051) | Cod sursa (job #2263329) | Cod sursa (job #1526744)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int main()
{
char a[100],b[100];
f>>a>>b;
int i,j,p,k,v[100],n,m;
n=strlen(a);
m=strlen(b);
i=j=k=0;
while(j<m-1)
{
if(a[i] == b[j])
{
p = j;
while(i<n && j< m && a[i] == b[j])
{
i++;
j++;
}
if(i == n)
{
i=0;
v[++k] = p;
j = p+1;
}
else
{
i = 0;
j = p+1;
}
}
else
j++;
}
g<<k<<'\n';
for(i=1;i<=k;i++)
g<<v[i]<<" ";
f.close();
g.close();
}