Pagini recente » Cod sursa (job #2869644) | Cod sursa (job #1783529) | Cod sursa (job #1061694) | Cod sursa (job #751725) | Cod sursa (job #1873431)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
int b[1000],k;
int main()
{
ifstream ci("strmatch.in");
ofstream cou("strmatch.out");
int tana,bum,i,j,sum=0,a;
char c[1000],b[1000];
ci>>c;
ci>>b;
a=strlen(b)-1;
bum=strlen(c)-1;
for(i=0;i<=a;i++)
{
tana=0;
if(c[0]==b[i])
{
for(j=1;j<=bum;j++)
{
if(c[j]!=b[i+j])
break;
else
tana+=1;
}
if(tana==bum)
{
sum=sum+1;
b[k]=i;
k++;
}
}
}
cou<<sum<<endl;
for(i=0;i<=k;i++)
cou<<b[k]<<" ";
return 0;
}