Pagini recente » Cod sursa (job #1091926) | Cod sursa (job #167689) | Cod sursa (job #1871926) | Cod sursa (job #1823096) | Cod sursa (job #1399084)
#include <fstream>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
ifstream is("strmatch.in");
ofstream os("strmatch.out");
int n, m;
string cuv, sir;
int cnt;
int p[1000], pos[1000];
void Prefix();
void KMP();
int main()
{
getline(is, cuv);
getline(is, sir);
m = cuv.length();
n = sir.length();
KMP();
os << cnt << '\n';
for ( int i = 0; i < cnt; ++i )
os << pos[i] << ' ';
is.close();
os.close();
return 0;
}
void Prefix()
{
int k = 0;
for (int i = 1; i < m; i++)
{
while ( k > 0 && cuv[k] != cuv[i] )
k = p[k - 1];
if ( cuv[k] == cuv[i] )
k++;
p[i] = k;
}
}
void KMP()
{
Prefix();
int k = 0;
for(int i = 0 ; i <= n; ++i)
{
while(k > 0 && cuv[k] != sir[i])
k = p[k-1];
if(cuv[k] == sir[i])
k++;
if(k == m)
pos[cnt++] = i - m + 1;
}
}