HDU 1686Oulipo (kmp模板题)
2016-07-24 17:58
351 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1686
Total Submission(s): 10800 Accepted Submission(s): 4230
[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
题目大意:光看样例就可以猜出来了,给你两个字符串,第二个字符串有多少子串跟第一个是相同的,输出结果。直接kmp就可以
#include <stdio.h>
#include <string.h>
char S[1000010],s[10010];
int next[10010];
int main()
{
int t,n,m;
scanf("%d", &t );
while( t--)
{
scanf("%s%s",s,S);
int m = strlen(s);
int n = strlen(S);
int j = 0,k = -1 ;
next[0] = -1;
while (j < m)
{
if( k == -1 || s[j] == s[k])
{
++j;
++k;
if( s[j] != s[k] )
next[j] = k;
else
next[j] = next[k];
}
else
{
k = next[k];
}
//printf("%d %d\n",j,next[j]);
}
int temp , res = 0;
int i = 0;j = 0 ;
while( i < n )
{
if(j == -1 || S[i] == s [j])
{
i++;
j++;
}
else
{
j = next[j];
}
if(j == m)
{
res++;
j = next[j];
}
}
printf("%d\n",res);
}
return 0;
}
Oulipo
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10800 Accepted Submission(s): 4230
[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
题目大意:光看样例就可以猜出来了,给你两个字符串,第二个字符串有多少子串跟第一个是相同的,输出结果。直接kmp就可以
#include <stdio.h>
#include <string.h>
char S[1000010],s[10010];
int next[10010];
int main()
{
int t,n,m;
scanf("%d", &t );
while( t--)
{
scanf("%s%s",s,S);
int m = strlen(s);
int n = strlen(S);
int j = 0,k = -1 ;
next[0] = -1;
while (j < m)
{
if( k == -1 || s[j] == s[k])
{
++j;
++k;
if( s[j] != s[k] )
next[j] = k;
else
next[j] = next[k];
}
else
{
k = next[k];
}
//printf("%d %d\n",j,next[j]);
}
int temp , res = 0;
int i = 0;j = 0 ;
while( i < n )
{
if(j == -1 || S[i] == s [j])
{
i++;
j++;
}
else
{
j = next[j];
}
if(j == m)
{
res++;
j = next[j];
}
}
printf("%d\n",res);
}
return 0;
}
相关文章推荐
- C语言 - 结构体
- 操作系统 单处理器进程调度模拟实验(c++)
- 第一个Python程序——执行cmd命令
- HDU 1711 Number Sequence(kmp模板)
- LeetCode -146 LRU Cache
- HDU 2087剪花布条 (kmp)
- HDU 1358 Period (kmp求循环节)
- HUST 1010 The Minimum Length (kmp求最小循环节)
- POJ 2406 Power Strings (kmp求循环节)
- POJ 2752 Seek the Name, Seek the Fame (kmp next数组运用)
- HDU 3336 Count the string(kmp)
- CodeForces 686C Robbers' watch (dfs)
- x86寄存器问题
- JavaSE 高级 第14节 读文件类FileReader
- HDU 5521 Meeting(虚拟节点+最短路)
- (OK) install VirtualBox Guest Additions
- 代码规范-标准化注释-iOS VVDocumenter
- CentOS 的安装
- Android 创建带有tab的滑动页面
- OkHttp的使用(1)