Pagini recente » Cod sursa (job #2423143) | Cod sursa (job #1019478) | Cod sursa (job #468109) | Cod sursa (job #2717017) | Cod sursa (job #2259211)
#include <fstream>
#include <cstring>
#define MAX 2000005
#define THRESH 1000
using namespace std;
char a[MAX], b[MAX];
int n, m, k, cnt, pi[MAX];
int main() {
ifstream f("strmatch.in");
ofstream g("strmatch.out");
f >> a + 1 >> b + 1;
n = strlen(a + 1);
m = strlen(b + 1);
k = 1;
for (int i = 2; i <= n; ++i) {
while (k && a[i] != a[k])
k = pi[k];
if (a[k] == a[i]) {
pi[i] = k;
++k;
} else
k = 1;
}
k = 1;
for (int i = 1; i <= m;) {
while (k && b[i] != a[k])
k = pi[k];
if (b[i] == a[k]) {
if (k == n) {
g << i - k << " ";
k = pi[k];
++cnt;
if (cnt == THRESH)
break;
} else {
++i;
++k;
}
} else{
++i;
k = 1;
}
}
g << "\n";
return 0;
}