Pagini recente » Cod sursa (job #2963284) | Cod sursa (job #2680371) | Cod sursa (job #2814804) | Cod sursa (job #2447369) | Cod sursa (job #810162)
Cod sursa(job #810162)
#include<fstream>
#include<string>
#define nmax 2000005
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[nmax],b[nmax];
int c[1005],k;
int main()
{
f>>a>>b;
int m=strlen(a),n=strlen(b),i,j=0;
if(m>n)
g<<0<<'\n';
else
{
do
{
i=0;
if(a[i]==b[j])
{
while(a[i]==b[j] && a[i] && b[j])
{
i++;
j++;
}
if(i==m)
{
c[k++]=j-m;
j=j-m+1;
}
}
else
j++;
}while(j<n && k<1000);
g<<k<<'\n';
if(k)
{
for(i=0;i<k;i++)
g<<c[i]<<' ';
g<<'\n';
}
}
f.close();
g.close();
return 0;
}