Pagini recente » Cod sursa (job #2652980) | Cod sursa (job #1400797) | Cod sursa (job #2319883) | Cod sursa (job #2319027) | Cod sursa (job #2946405)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s,s2,s3;
int n,n2,k,i,urm[4000005],nr;
vector <int> aparitii;
int main()
{
f>>s;
f>>s2;
n = s.size();
n2 = s2.size();
s3 = s+ '#'+s2;
urm[0]=0;
k=0;
for (i=1;i<s3.size();i++)
{
while (k&&s3[i]!=s3[k])
{
k = urm[k-1];
}
if (s3[i]==s3[k])
{
k++;
}
urm[i] = k;
if (k==n)
{
nr++;
if (nr<=1000)
{
aparitii.push_back(i - 2*n);
}
}
}
g<<nr<<'\n';
for (i=0;i<aparitii.size();i++)
{
g<<aparitii[i]<<" ";
}
return 0;
}