Pagini recente » Cod sursa (job #2420352) | Cod sursa (job #160682) | Cod sursa (job #728922) | Cod sursa (job #980137) | Cod sursa (job #2989965)
#include <bits/stdc++.h>
#define MAXSZ 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[MAXSZ], b[MAXSZ];
int lps[MAXSZ];
int main() {
fin.getline(a, MAXSZ);
fin.getline(b, MAXSZ);
int aSz = (int)strlen(a);
int bSz = (int)strlen(b);
int q = 0;
for (int i = 2; i <= aSz; i++) {
while (q && a[q] != a[i - 1])
q = lps[q];
if (a[q] == a[i - 1])
q++;
lps[i] = q;
}
vector<int> matches;
q = 0;
for (int i = 0; i < bSz; i++) {
while (q && a[q] != b[i])
q = lps[q];
if (a[q] == b[i])
q++;
if (q == aSz) {
matches.push_back(i - aSz + 1);
q = lps[q];
}
}
fout << matches.size() << '\n';
for (int i = 0; i < min(matches.size(), 1000); i++)
fout << match << ' ';
return 0;
}