poj 3461 Oulipo

kmp模板：

/* KMP 模板
较难理解,较难解释。。 
练习： NYOJ-5 ， POJ-3461
*/ 

#include <stdio.h>
#include <string.h>
#define N 100 

int KMP(char s[], char t[], int lens, int lent);
void GetNext(char t[], int lent);

int next[N];

int main()
{
	char s[N], t[N];
	printf("请输入母串: ");
	scanf("%s", s);
	printf("请输入子串：") ;
	scanf("%s", t) ;
	
	int lens = strlen(s);
	int lent = strlen(t);
	int pos = KMP(s, t, lens, lent);
	
	if(pos == -1){							// 返回值为 -1 代表未找到 
		printf("Not Found!\n");
	}
	else{
		printf("匹配位置：%d\n",pos);		// 从0开始 
	}
	
	return 0;
}

int KMP(char s[], char t[], int lens, int lent)
{
	GetNext(t, lent);						// 求得next数组 
	
	int i = 0, j = 0;
	while(i < lens && j < lent){
		if(j == -1 || s[i] == t[j]){
			i ++;
			j ++;
		}
		else{
			j = next[j];
		}
	}
	
	if(j == lent){
		return i - lent;
	}
	else{
		return -1;
	}
}

void GetNext(char t[], int lent)
{
	int i = 0, j = -1;
	next[0] = -1;	
	while(i < lent){
		if(j == -1 || t[i] == t[j]){
			i ++;
			j ++;
			next[i] = j;
		}
		else{
			j = next[j];
		}
	}
}

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

#include<stdio.h>
#include <string.h>
int lens, lent, next[10010];
char s[1000010], t[10010];
void getnext()
{
    int i = 0, j = -1;
    next[0] = -1;
    while(i < lent)
    {
        if(j == -1 || t[i] == t[j])
        {
            i++;
            j++;
            next[i] = j;
        }
        else
            j = next[j];
    }
}
int kmp()
{
    int sum = 0;
    int i = 0, j = 0;
    while(i < lens && j < lent)
    {
        if(j == -1 || s[i] == t[j])
        {
            i++;
            j++;
        }
        else
            j = next[j];

        if(j == lent) //注意这里。当一次匹配成功后，不能退出循环，而是j再变为新的j，继续进行匹配
        {
            sum++;
            j = next[j];
        }
    }
    return sum;
}
int main()
{
    int n;
    scanf("%d", &n);
    while(n--)
    {
        scanf("%s", t);
        scanf("%s", s);
        lens = strlen(s);
        lent = strlen(t);
        getnext();
        printf("%d\n", kmp());
    }
    return 0;
}