题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2087
题意:中文题
解析:kmp计数(匹配完时j=0)
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int maxn = 1000+100;
char a[maxn],b[maxn];
int nex[maxn];
void getNex(char a[])
{
int len = strlen(a);
memset(nex,-1,sizeof(nex));
int i=0,k=-1;
while(i<len)
{
if(k==-1 || a[i]==a[k])
{
i++,k++;
nex[i] = k;
}
else
k = nex[k];
}
}
int kmp_count(char a[],char b[])
{
getNex(b);
int len1 = strlen(a);
int len2 = strlen(b);
int cnt = 0,i = 0,j = 0;
while(i<len1 && j<len2)
{
if(a[i]==b[j])
{
i++;
j++;
if(j==len2)
{
cnt++;
j = 0;
}
}
else if(j==0)
i++;
else
j = nex[j];
}
return cnt;
}
int main(void)
{
while(~scanf("%s",a)&&a[0]!='#')
{
scanf("%s",b);
int ans = kmp_count(a,b);
printf("%d\n",ans);
}
return 0;
}