Pagini recente » Cod sursa (job #138199) | Cod sursa (job #1788600) | Cod sursa (job #2233574) | Cod sursa (job #31773) | Cod sursa (job #1637035)
#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int nr[1000],k=1,i,q,l,numere=0;
char a[2000000],b[2000000];
int main()
{
f>>a;
f>>b;
int n=strlen(a)-1,m=strlen(b)-1;
char c[n];
cout<<b[0]<<m;
for(i=0;i<=m;i++)
{q=0;
while(a[q]==b[i+q]&&q-1<=n)
{
q++;
}
if(q-1==n&&k<=1000)
{numere++;
nr[k]=i;
k++;
}
}
g<<numere<<"\n";
for(l=1;l<k;l++)
g<<nr[l]<<" ";
return 0;
}