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
求第一个单词在第二个字符串中出现的次数,可重叠 注意字符串长度(wa了10次)
代码:
//Full of love and hope for life
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/
using namespace std;
int nex[10010];
char n[10010],m[1000010];
int ans;
void getnext(char a[],int x){
int j=-1;
nex[0]=-1;
for(int i=1;i<x;i++){
if(j!=-1&&a[i]!=a[j+1]){
j=nex[j];
}
if(a[i]==a[j+1]){
j++;
}
nex[i]=j;
}
}
int kmp(char a[],char b[],int x,int y){
getnext(b,y);
int j=-1;
for(int i=0;i<x;i++){
while(j!=-1&&a[i]!=b[j+1]){
j=nex[j];
}
if(a[i]==b[j+1]){
j++;
}
if(j==y-1){
ans++;
}
}
return ans;
}
int main(){
int a;
scanf("%d",&a);
while(a--){
ans=0;
scanf("%s%s",n,m);
int len1=strlen(n);
int len2=strlen(m);
cout << kmp(m,n,len2,len1) << endl;
}
return 0;
}