【KMP】codevs1204——寻找子串位置

写暴力很无聊的啦，写KMP吧

p.s 新代码风格形成中

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define red(i, a, b) for(int i = (a); i >= (b); i--)
#define ll long long

const int maxn = 1000;
int f[maxn];

void getfail(char*, int*);
void find(char* T, char* P, int* f) {
	int n = strlen(T), m = strlen(P);
	getfail(P, f);
	int j = 0;
	rep(i, 0, n-1){
		while(j && P[j] != T[i]) j = f[j];
		if (P[j] == T[i]) j++;
		if (j == m) printf("%d\n", i-m+2);
	}
}

void getfail(char* P, int* f) {
	int m = strlen(P);
	f[0] = 0; f[1] = 0;
	rep(i, 1, m-1){
		int j = f[i];
		while(j && P[i]!=P[j]) j=f[j];
		f[i+1] = P[i] == P[j] ? j+1 : 0;
	}
}

int main() {
	char a[maxn], b[maxn];
    cin >> a >> b;
    find(a, b, f);
    return 0;
}