8.11 J
来源:互联网 发布:德怀特霍华德生涯数据 编辑:程序博客网 时间:2024/05/20 05:25
J - Oulipo
The French authorGeorges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. Aquote from the book:
Tout avait Pairnormal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puissurgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulaitl’association qui l’unissait au roman : stir son tapis, assaillant à toutinstant 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 commandanttout, où s’abolissait la raison : tout avait l’air normal mais…
Perec wouldprobably have scored high (or rather, low) in the following contest. People areasked to write a perhaps even meaningful text on some subject with as fewoccurrences of a given “word” as possible. Our task is to provide the jury witha program that counts these occurrences, in order to obtain a ranking of thecompetitors. These competitors often write very long texts with nonsensemeaning; a sequence of 500,000 consecutive 'T's is not unusual. And they never use spaces.
So we want toquickly find out how often a word, i.e., a given string, occurs in a text. Moreformally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finitestrings over that alphabet, a word W and a text T,count the number of occurrences of W in T. All theconsecutive characters of W must exactly match consecutive characters of T.Occurrences may overlap.
Input
The first line ofthe 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 testcase in the input file, the output should contain a single number, on a singleline: 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
题意:输入T组样例,每组样例为两个字符串,判断第一个字符串在第二个字符串中出现几次,例如AZA,AZAZAZA,可以把第二个字符串拆成AZA,AZA,AZA(可以将字符串重复拆分),所以第一个字符串在第二个字符串中出现的3次,输出3。