Pagini recente » Cod sursa (job #386737) | Cod sursa (job #1212961) | Cod sursa (job #2670179) | Cod sursa (job #277924) | Cod sursa (job #2374930)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int VAL=2000005;
int N, M, i, j, FF[VAL], poz;
string P, T;
vector <int> SOL;
int main()
{
fin >> P >> T;
N=P.size();
M=T.size();
P='*'+P+'*';
T='*'+T+'*';
for (i=2; i<=N; i++)
{
poz=FF[i-1];
while (poz>0 && P[i]!=P[poz+1])
poz=FF[poz];
if (P[i]==P[poz+1])
FF[i]=poz+1;
}
poz=0;
for (i=1; i<=M; i++)
{
while (poz>0 && T[i]!=P[poz+1])
poz=FF[poz];
if (T[i]==P[poz+1])
poz++;
if (poz==N)
SOL.push_back(i-N);
}
fout << SOL.size() << '\n';
for (i=0; i<SOL.size(); i++)
{
if (i==1000)
break;
fout << SOL[i] << " ";
}
fin.close();
fout.close();
return 0;
}