The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:
Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…
Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive 'T's is not unusual. And they never use spaces.
So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.
Input
The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:
One line with the word W, a string over {'A', 'B', 'C', …, 'Z'}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
One line with the text T, a string over {'A', 'B', 'C', …, 'Z'}, with |W| ≤ |T| ≤ 1,000,000.
Output
For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.
Sample Input
3 BAPC BAPC AZA AZAZAZA VERDI AVERDXIVYERDIAN
Sample Output
1 3 0
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
#define maxn 1000008
char s[maxn];
char t[maxn];
int nxt[maxn];
int a,b;
void getnxt()
{
nxt[0]=0;
int i=1,j=0;
while(i<b)
{
if(t[i]==t[j])
{
nxt[i++]=++j;
}
else if(!j){
i++;
}
else
{
j=nxt[j-1];
}
}
}
int kmp()
{
int i=0,j=0,ans=0;
while(i<a&&j<b)
{
if(s[i]==t[j])
{
i++;j++;
}
else if(!j)
{
i++;
}
else{
j=nxt[j-1];
}
if(j==b)
{
j=nxt[j-1];ans++;//注意j的取值,既然j==b说明已经有一个字串出现了此时j=nxt[j-1];
//eg:AZA AZAZAZAZA ;AZA的nxt为0 0 1; 当j=3,i=3时 j=net[3-1]=1,所以j就从下标1开始
}
}
return ans;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%s",t);
scanf("%s",s);
//scanf("%s",t);
a=strlen(s);
b=strlen(t);
getnxt();
printf("%d\n",kmp());
}
return 0;
}