poj3461 Oulipo
来源:互联网 发布:mac系统星际2打不开 编辑:程序博客网 时间:2024/06/05 12:14
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
3BAPCBAPCAZAAZAZAZAVERDIAVERDXIVYERDIAN
Sample Output
130
Source
Analysis
Code
//poj3461 Oulipo KMP裸题#include <cstdio>#include <cstring>using namespace std;int W, T, C, next[10010];char w[10010], t[1000010];void init(){int i, j;for(i=2,j=0;i<=W;i++){for(;w[i]!=w[j+1]&&j;j=next[j]);next[i] = w[i]==w[j+1]?++j:0;}}void kmp(){int i, j, ans;ans=0;for(i=1,j=0;i<=T;i++){for(;t[i]!=w[j+1]&&j;j=next[j]);if(t[i]==w[j+1])++j;if(j==W)ans++;}printf("%d\n",ans);}int main(){scanf("%d",&C);w[0]=t[0]=48;while(C--){scanf("%s%s",w+1,t+1);W=strlen(w)-1;T=strlen(t)-1;init();kmp();}return 0;}
- POJ3461:Oulipo
- POJ3461 Oulipo
- poj3461 Oulipo
- poj3461-Oulipo
- poj3461 Oulipo
- POJ3461 Oulipo
- POJ3461 Oulipo
- poj3461 Oulipo
- 【POJ3461】Oulipo
- poj3461 Oulipo
- 【POJ3461】Oulipo
- 【KMP】 poj3461 Oulipo
- 【KMP】Oulipo POJ3461
- poj3461 Oulipo (kmp)
- [POJ3461] Oulipo[KMP基础]
- poj3461 Oulipo,Kmp
- POJ3461 Oulipo 【KMP】
- POJ3461 Oulipo KMP
- MySQL进阶(一)
- AES PKCS5Padding
- javaWeb_Request_Response
- 仓库管理系统系列——3、终结篇
- 我的程序员之路
- poj3461 Oulipo
- 【Android基础知识】Android Studio 编译慢及 Adb connection Error:远程主机强迫关闭了一个现有的连接
- dd命令详解
- C语言程序设计谭浩强版 六
- nginx架构初探
- linux,/etc/passwd,/etc/shadow详解
- 二叉树的实现Java
- 17.1.2.1 Advantages and Disadvantages of Statement-Based and Row-Based Replication
- Json解析工具Jackson(使用注解)