Pagini recente » Cod sursa (job #2392712) | Cod sursa (job #3168779) | Cod sursa (job #1131665) | Cod sursa (job #2310145) | Cod sursa (job #2577757)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000001],b[2000001];
int v[1002],n,m,i,j,k,q;
int main()
{
f>>a;
f.get();
f>>b;
n=strlen(a);
m=strlen(b);
while(q < m)
{
if(a[j]==b[q])
{
i=q;
while(a[j]==b[i]&&j<n&&i<m)
{
i++;
j++;
}
if(j==n)
{
v[++k]=i-j;
if(k>1000)
break;
}
j=0;
}
q++;
}
g<<k<<"\n";
for(i=1; i<=k; ++i)
g<<v[i]<<" ";
return 0;
}