hdu 1686 Oulipo(kmp)
2012-12-31 13:22
351 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1686
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN
[align=left]Sample Output[/align]
1
3
0
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN
[align=left]Sample Output[/align]
1
3
0
#include<iostream> using namespace std; char str1[10010],str2[1000010]; int next[10010]; void get_next() { int len=strlen(str1); next[0]=-1; int j=-1,i=0; while(i<len) { if(j==-1||str1[i]==str1[j]) { i++; j++; next[i]=j; } else j=next[j]; } } int kmp() { int len1=strlen(str1); int len2=strlen(str2); int i=0,j=0,cnt=0; while(i<len2) { if(j==-1||str1[j]==str2[i]) { i++; j++; } else j=next[j]; if(j>=len1) { cnt++; j=next[j]; } } return cnt; } int main() { int t; scanf("%d",&t); getchar(); while(t--) { gets(str1); gets(str2); get_next(); printf("%d\n",kmp()); } return 0; }
相关文章推荐
- KMP——HDU 1686 Oulipo
- hdu 1686 Oulipo(KMP)
- hdu 1686 Oulipo (KMP模板)
- HDU 1686 (KMP模式串出现的次数) Oulipo
- HDU 1686 Oulipo(KMP)
- hdu-1686-Oulipo(KMP)
- hdu 1686 Oulipo(KMP)
- 【kmp字符串匹配】hdu 1686 Oulipo
- HDU-1686-Oulipo(KMP)
- HDU 1686 - Oulipo(kmp)
- HDU 1686 Oulipo(KMP水题)java实现
- hdu 1686 Oulipo 裸的KMP
- HDU 1686--Oulipo【KMP】
- HDU-1686 Oulipo (kmp)
- HDU 1686 Oulipo (kmp)
- HDU - 1686 Oulipo (KMP)
- HDU 1686 Oulipo(KMP)
- HDU-1686 - Oulipo - KMP
- HDU- KMP模板题 - 1686 Oulipo - 2087 剪花布条 - 3746 Cyclic Nacklace
- hdu 1686 Oulipo KMP 纯手搓