Pagini recente » Cod sursa (job #35211) | Cod sursa (job #746252) | Cod sursa (job #2442661) | Cod sursa (job #1535149) | Cod sursa (job #683167)
Cod sursa(job #683167)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{ifstream f("strmatch.in");
ofstream g("strmatch.out");
int n,i,ok,s,t,q,v[1000];
char a[100000],b[100000];
f.get(a,1000000);
f.get();
f.get(b,1000000);
s=strlen(a);
t=strlen(b);
for(i=1;i<=1000;i++)
v[i]=0;
i=0;
n=0;
while(n<=1000&&i<=t)
if(a[0]==b[i])
{ok=1;
for(q=0;q<=s-1;q++)
if(a[q]!=b[i+q])
ok=0;
if(ok==1)
{n++;
v[n]=i;
i++;
}
else i++;}
else i++;
g<<n<<endl;
for(i=1;i<=n;i++)
g<<v[i]<<" ";
f.close();
g.close();
return 0;
}