B. Strings of Power
来源:互联网 发布:哪些数据库 触发器 编辑:程序博客网 时间:2024/05/16 17:20
B. Strings of Power
Volodya likes listening to heavy metal and (occasionally) reading. No wonder Volodya is especially interested in texts concerning his favourite music style.
Volodya calls a string powerful if it starts with "heavy" and ends with "metal". Finding all powerful substrings (by substring Volodya means a subsequence of consecutive characters in a string) in a given text makes our hero especially joyful. Recently he felt an enormous fit of energy while reading a certain text. So Volodya decided to count all powerful substrings in this text and brag about it all day long. Help him in this difficult task. Two substrings are considered different if they appear at the different positions in the text.
For simplicity, let us assume that Volodya's text can be represented as a single string.
Input
Input contains a single non-empty string consisting of the lowercase Latin alphabet letters. Length of this string will not be greater than 106 characters.
Output
Print exactly one number — the number of powerful substrings of the given string.
Sample test(s)
input
heavymetalisheavymetal
output
3
input
heavymetalismetal
output
2
input
trueheavymetalissotruewellitisalsosoheavythatyoucanalmostfeeltheweightofmetalonyou
output
3
Note
In the first sample the string "heavymetalisheavymetal" contains powerful substring "heavymetal" twice, also the whole string "heavymetalisheavymetal" is certainly powerful.
In the second sample the string "heavymetalismetal" contains two powerful substrings: "heavymetal" and "heavymetalismetal".
代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
char a[2000000];
int main()
{
while(cin>>a){
int len=strlen(a);
long long rec=0,sum=0;
for(int i=0;i<len;i++){
if(a[i]=='h'&&a[i+1]=='e'&&a[i+2]=='a'&&a[i+3]=='v'&&a[i+4]=='y'){i+=4;rec++;}
else {
if(a[i]=='m'&&a[i+1]=='e'&&a[i+2]=='t'&&a[i+3]=='a'&&a[i+4]=='l'){sum=sum+rec;i+=4;}
}
}
cout<<sum<<endl;
}
return 0;
}
- B. Strings of Power
- B. Strings of Power
- cf 318B. Strings of Power
- Codeforces Round #188 (Div. 2) B. Strings of Power
- Code Forces B. Strings of Power 字符串处理
- Strings of Power
- [选拔赛]Strings of Power
- Strings of Power
- Strings of Power
- Strings of Power
- codeforces Strings of Power
- Strings of Power
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- pdf与word之间的相互转换以及pdf的编辑
- 如何取消开机用户选择
- Android 蓝牙状态机以及蓝牙启动状态机
- Sping3.x+quartz动态定时器
- oracle左右连接
- B. Strings of Power
- Android基础知识及疑问
- 进程通信
- 蓝桥 公式解析
- Extjs4.0上传并解析excel和导出excel
- 经典站录之-【尤怪之家】
- Srping 基础学习
- NSPredicate的用法
- MyEclipse无法自动编译