Pagini recente » Cod sursa (job #2412941) | Cod sursa (job #1682851) | Cod sursa (job #881853) | Cod sursa (job #2008941) | Cod sursa (job #2199831)
#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string s1, s2;
vector<int> p, res;
int n, m;
void prefix(string b)
{
int k=0, i;
p.resize(m+1);
p[1]=0;
for(i=2;i<=m;i++)
{
while(k&&b[i]!=b[k+1])
k=p[i];
if(b[i]==b[k+1])
k++;
p[i]=k;
}
}
void KMP(string a, string b)
{
int k=0, i;
n=a.size();
m=b.size();
a=' '+a;
b=' '+b;
prefix(b);
for(i=1;i<=n;i++)
{
while(k&&a[i]!=b[k+1])
k=p[k];
if(a[i]==b[k+1])
k++;
if(k==m)
res.push_back(i-k);
}
}
int main()
{
getline(f, s2);
getline(f, s1);
KMP(s1, s2);
g<<res.size()<<'\n';
for(auto a:res)
g<<a<<' ';
f.close();
g.close();
return 0;
}