Pagini recente » Cod sursa (job #256637) | Cod sursa (job #692385) | Cod sursa (job #1586172) | Cod sursa (job #632591) | Cod sursa (job #970220)
Cod sursa(job #970220)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int Nmax = 2000009;
int N; int M; char A[Nmax]; char B[Nmax]; int H[Nmax]; int q = 0;
void Read() {
fin >> A + 1; fin.get();
fin >> B + 1;
N = strlen(A + 1);
M = strlen(B + 1);
}
void Precalc() {
for(int i = 2; i <= N; ++i) {
while(q > 0 && A[i] != A[q + 1])
q = H[q];
if(A[i] == A[q + 1]) ++q;
H[i] = q;
}
}
void Solve() {
q = 0;
for(int i = 1; i <= M; ++i) {
while(q && B[i] != A[q + 1])
q = H[q];
if(A[q + 1] == B[i]) ++q;
if(q == N) fout << i - q <<" ";
}
}
int main() {
Read();
Precalc(); Solve ();
return 0;
}