Pagini recente » Cod sursa (job #238891) | Istoria paginii runda/885900/clasament | Istoria paginii utilizator/diananita | Cod sursa (job #2319040) | Cod sursa (job #3004114)
#include <bits/stdc++.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s,s2,s3;
int n,k,i,urm[4000005],sol[20005],nr;
int main()
{
f>>s;
f>>s2;
n = s.size();
s3 = s+'#'+s2;
k = 0;
vector <int> v;
for (i=1;i<s3.size();i++)
{
while (k && s3[i]!=s3[k])
{
k = urm[k-1];
}
if (s3[i] == s3[k])
{
k++;
}
if (k==n)
{
if (nr<1000)
{
nr++;
sol[nr]=i-2*n;
}
}
urm[i] = k;
}
g<<nr<<'\n';
for (i=1;i<=nr;i++)
{
g<<sol[i]<<" ";
}
return 0;
}