Pagini recente » Cod sursa (job #1159588) | Cod sursa (job #2899626) | Cod sursa (job #197808) | Cod sursa (job #1809183) | Cod sursa (job #2175257)
#include <string.h>
#include <fstream>
#define NMAX 2000005
using namespace std;
int sol[NMAX];
char S[NMAX], P[NMAX], T[NMAX];
int nrsol = 0;
int n,m;
ifstream fi("strmatch.in");
ofstream fo("strmatch.out");
int main()
{
fi>>(P+1);
fi>>(S+1);
n = strlen(P+1);
m = strlen(S+1);
int nrsol = 0;
T[0] = T[1] = 0;
int k = 0;
for(int i = 2; i <= n; ++i)
{
while( k > 0 && P[k+1] != P[i])
k = T[k];
if(P[k+1] == P[i])
k++;
T[i] = k;
}
k = 0;
for(int i = 1; i <= m; ++i)
{
while( k > 0 && P[k+1] != S[i])
k = T[k];
if(P[k+1] == S[i])
k++;
if(k == n)
{
k = T[k];
sol[++nrsol] = i - n;
}
}
fo<<nrsol<<'\n';
for(int i = 1; i <= min(nrsol, 1000); ++i)
fo<<sol[i]<<" ";
}