问在父文本中子文本出现多少次，不能算重合部分，也就是说aaaaaa，aa只出现三次

思路：kmp！！！！！！,其实这道题用BF算法反而更快（滑稽）就是不在kmp函数中调用getnext函数;

代码

#include<iostream>
#include<string>
#include<cstring>

using namespace std;

const int maxn = 1100;
int nxt[maxn];
string bu;
string xiao;
int len, len2;

void getnext()
{
		int i = 0;
		int j = -1;
		nxt[0] = -1;
		while (i<len2)
		{
				if (j == -1 || xiao[i] == xiao[j])
				{
						nxt[++i] = ++j;
				}
				else j = nxt[j];
		}
}

int kmp()
{
		int ans = 0;
		int j = 0, i = 0;
		if (len == 1 && len2 == 1) {
				if (bu[0] == xiao[0])
						return 1;
				else return 0;
		}
		getnext();
		for (i = 0; i<len; i++)
		{
				while (j>0 && bu[i] != xiao[j]) j = nxt[j];
				if (bu[i] == xiao[j]) j++;
				if (j == len2)
				{
						ans++;
						j =nxt[j];
				}
		}
		return ans;
}

int main()
{
		ios::sync_with_stdio(false);
		while (cin >> bu)
		{
				if (bu == "#") break;
				cin >> xiao;
				len = bu.size();
				len2 = xiao.size();
				int ans = kmp();
				cout << ans << endl;
				bu.clear();
				xiao.clear();
		}
		return 0;
}