Pagini recente » Cod sursa (job #811990) | Cod sursa (job #2666932) | Cod sursa (job #683264) | Cod sursa (job #2061799) | Cod sursa (job #1076144)
#include<fstream>
#include<cstring>
using namespace std;
char a[2000000],b[2000000];
int n,m,nr,i,j;
long v[1001];
int main()
{
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f>>a; f>>b;
n=strlen(a);
m=strlen(b);
for(i=0;i<=m-n;i++)
{
j=0;
while(a[j]==b[i+j]&&j<n) j++;
if(j==n)
{nr++;
if(nr<=1000) v[nr]=i;
}}
g<<nr<<'\n';
for(i=1;i<=nr&&i<=1000;i++)
g<<v[i]<<" ";
}