剪花布條
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7622 Accepted Submission(s): 5003
#include<stdio.h>
#include<string.h>
char s[1004],t[1004];
int next[1004],ans;
void get_nextval(int len)
{
int i=0,k=-1;
next[0]=-1;
while(i<len)
if(k==-1||t[i]==t[k])
{
++i;
++k;
if(t[i]!=t[k])
next[i]=k;
else
next[i]=next[k];
}
else
k=next[k];
}
void KMP(int ls,int lt)
{
get_nextval(lt);
int i=0,j=0;
while(i<ls&&j<lt)
if(s[i]==t[j])
{
i++;
j++;
if(j==lt)
{
ans++;
j=0;
}
}
else
{
if(next[j]!=-1)
j=next[j];
else
{
j=0;
i++;
}
}
}
int main()
{
while(scanf("%s",s),s[0]!='#')
{
scanf("%s",t);
int ls=strlen(s),lt=strlen(t);
ans=0;
KMP(ls,lt);
printf("%d\n",ans);
}
return 0;
}