Pagini recente » Cod sursa (job #2122549) | Cod sursa (job #924348) | Cod sursa (job #3271376) | Cod sursa (job #2144161) | Cod sursa (job #2577765)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000001],b[2000001];
int n,m,i,j,q;
vector<int> v;
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.push_back(i-j);
j=0;
}
q++;
}
if(v.size()<1001)
g<<v.size()<<"\n";
else
g<<1000<<"\n";
for(i=0; i<v.size()&&i<1000; ++i)
g<<v[i]<<" ";
return 0;
}