Oulipo

Oulipo

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5700    Accepted Submission(s): 2284

Problem Description

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
  

 

Source

华东区大学生程序设计邀请赛_热身赛

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1358  1711  3336  3746  3068 

本题是一道字符串匹配问题，运用的是kmp算法，基本是模板，虽然说起来比较简单，但是这个算法花了我一个上午才看懂了大概，水平啊！！！渣

代码：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int next[1000010];
void getnext(char *p)
{
int i,j;
int p1;
j=0;
i=-1;
next[0]=-1;
p1=strlen(p);
while(j<p1)
{
if(i==-1||p[i]==p[j])
{
j++;
i++;
if(p[i]!=p[j])
next[j]=i;
else
next[j]=next[i];
}
else 
{
i=next[i];
}
}
}
int kmp(char *p,char *s)
{
int count=0;
int p2=strlen(p);
int p1=strlen(s);
getnext(p);
int i,j;
i=0;j=0;
while(i<p1)
{
// j=0;
 
//while(i<p1&&j<p2)
// {
if(j==-1||s[i]==p[j])
{
i++;j++;
}
else {
j=next[j];
}
// }


if(j==p2)
{
   count++;
   j=next[j];
}
   }
   return count;
}


int main()
{
char p[10010];
char s[1000010];
int i,j,n,m,k;
scanf("%d",&n);
while(n--)
{
scanf("%s",p);
scanf("%s",s);
k=kmp(p,s);
printf("%d\n",k);
}
return 0;
}