HDU - 5763 Another Meaning
As is known to all, in many cases, a word has two meanings. Such as “hehe”, which not only means “hehe”, but also means “excuse me”.
Today, ?? is chating with MeiZi online, MeiZi sends a sentence A to ??. ?? is so smart that he knows the word B in the sentence has two meanings. He wants to know how many kinds of meanings MeiZi can express.InputThe first line of the input gives the number of test cases T; T test cases follow.
Each test case contains two strings A and B, A means the sentence MeiZi sends to ??, B means the word B which has two menaings. string only contains lowercase letters.
Limits
T <= 30
|A| <= 100000
|B| <= |A|
OutputFor each test case, output one line containing “Case #x: y” (without quotes) , where x is the test case number (starting from 1) and y is the number of the different meaning of this sentence may be. Since this number may be quite large, you should output the answer modulo 1000000007.Sample Input
4 hehehe hehe woquxizaolehehe woquxizaole hehehehe hehe owoadiuhzgneninougur iehiehieh
Sample Output
Case #1: 3 Case #2: 2 Case #3: 5 Case #4: 1
Hint
In the first case, “ hehehe” can have 3 meaings: “*he”, “he*”, “hehehe”. In the third case, “hehehehe” can have 5 meaings: “*hehe”, “he*he”, “hehe*”, “**”, “hehehehe”.
1 #include<iostream> 2 #include<stdio.h> 3 #include<string.h> 4 #include<algorithm> 5 using namespace std; 6 7 char s1[100005],s2[100005],nex[100005]; 8 long long vis[100005],dp[100005]; 9 10 int main(){ 11 long long t,i,j,cas=1; 12 scanf("%lld",&t); 13 while(t--){ 14 scanf("%s%s",s1,s2);// s2 是匹配串 15 memset(nex,-1,sizeof(nex)); //初始化为-1 16 memset(vis,0,sizeof(vis)); 17 memset(dp,0,sizeof(dp)); 18 long long n=strlen(s1); 19 long long m=strlen(s2); 20 j=-1; 21 for(i=1;i<m;i++){ 22 while(j>=0&&s2[j+1]!=s2[i])j=nex[j]; 23 if(s2[j+1]==s2[i])j++; 24 nex[i]=j; 25 } 26 j=-1; 27 for(i=-1;i<n-1;i++){ 28 while(j>=0&&s2[j+1]!=s1[i+1])j=nex[j]; 29 if(s2[j+1]==s1[i+1])j++; 30 if(j==m-1){ 31 //j=next[j]; //重叠匹配 32 //j=-1; //从头匹配 33 j=nex[j]; 34 vis[i+1]=1; 35 } 36 } 37 long long num=0; 38 for(i=0;i<m;i++){ 39 dp[i]=vis[i]; 40 } 41 for(;i<n;i++){ 42 if(vis[i]){ 43 dp[i]=(dp[i-1]+dp[i-m]+1)%1000000007; 44 } 45 else dp[i]=dp[i-1]; 46 } 47 printf("Case #%lld: %lld\n",cas++,(dp[n-1]+1)%1000000007); 48 } 49 return 0; 50 }
转载于:https://www.cnblogs.com/xibeiw/p/7308288.html
HDU - 5763 Another Meaning相关推荐
- HDU 5763 Another Meaning KMP+DP
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5763 Another Meaning Time Limit: 2000/1000 MS (Java/ ...
- 【47.92%】【hdu 5763】Another Meaning
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission ...
- 暑期集训3:几何基础 练习题G: HDU - 1052
2018学校暑期集训第三天--几何基础 练习题G -- HDU - 1052 (昨天加练题) Tian Ji -- The Horse Racing Here is a famous sto ...
- HDU 4738 Caocao‘s Bridges(桥、任何位运算一定都要加括号、因为有重边所以用前向星)
HDU 4738 Caocao's Bridges(桥.任何位运算一定都要加括号.因为有重边所以用前向星) Caocao was defeated by Zhuge Liang and Zhou Yu ...
- hdu 2433 Travel
http://acm.hdu.edu.cn/showproblem.php?pid=2433 题意: 求删除任意一条边后,任意两点对的最短路之和 以每个点为根节点求一个最短路树, 只需要记录哪些边在最 ...
- HDU 5025:Saving Tang Monk(BFS + 状压)
http://acm.hdu.edu.cn/showproblem.php?pid=5025 Saving Tang Monk Problem Description <Journey to t ...
- HDU - 4578Transformation——线段树+区间加法修改+区间乘法修改+区间置数+区间和查询+区间平方和查询+区间立方和查询
[题目描述] HDU - 4578Transformation Problem Description Yuanfang is puzzled with the question below: The ...
- Junk-Mail Filter_并查集(hdu 2473)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2473 Problem Description Recognizing junk mails is a ...
- hdu 4970 Killing Monsters(数学题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4970 Problem Description Kingdom Rush is a popular TD ...
最新文章
- string 基本用法
- R语言找到CRAN库已经不在提供的包、手动下载并使用RStudio进行安装
- 谈谈我对Java中CallBack的理解
- matlab中服从高斯分布的矩阵_一些张量的计算步骤matlab代码
- oracle exp 00006,Oracle 12.1新特性----使用RMAN从备份中实现recover table
- MyEclipse中Hibernate+C3P0连接池配置
- 【02】查询优化的技术范围
- 代码描述10911 - Forming Quiz Teams
- c# 中的除法运算需要注意
- 奇偶校验方法(韦根协议)
- SpringMVC文件上传和Jwt身份验证
- php1蛋白质带电情况,拿到一个蛋白以后,首先需要对蛋白进行全面的了解,所谓知彼知己方能百战不殆:...
- 2014年FME校园培训考核通过名单
- Pyramidal Convolution: Rethinking Convolutional Neural Networks for Visual Recognition阅读笔记
- python-spider个人笔记
- 我国的社保到底是多交好,还是少交好?
- 测试案例中@SpringBootTest与@RunWith**的含义
- MinIO 中的图片在前端列表渲染时报错 404
- Oracle的网络三大配置文件(sqlnet.ora、tnsnames.ora、listener.ora)
- 【2018-11-09】中证500指数的估值详情