Strings of Power
来源:互联网 发布:c语言神奇海螺 编辑:程序博客网 时间:2024/06/05 21:38
Think:
字符串水题, 注意 heavy 和 metal 即可
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.Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.
**Example
Input**
heavymetalisheavymetal**Output**3**Input**heavymetalismetal**Output**2**Input**trueheavymetalissotruewellitisalsosoheavythatyoucanalmostfeeltheweightofmetalonyouOutput3
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<iostream>#include<cstdio>#include<string>using namespace std;int main(){ string str; while(cin >> str) { long long int sum, i, temp; sum = temp = 0; for (i = 0; i < str.size(); i ++) { if (str[i] == 'h' && str[i + 1] == 'e' && str[i + 2] == 'a' && str[i + 3] == 'v' && str[i + 4] == 'y') { i = i + 4; temp ++; } if (str[i] == 'm' && str[i + 1] == 'e' && str[i + 2] == 't' && str[i + 3] == 'a' && str[i + 4] == 'l') { i = i + 4; sum = sum + temp; } } cout << sum << endl; }}
阅读全文
0 0
- B. Strings of Power
- Strings of Power
- [选拔赛]Strings of Power
- Strings of Power
- Strings of Power
- B. Strings of Power
- Strings of Power
- codeforces Strings of Power
- Strings of Power
- cf 318B. Strings of Power
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- Power Strings
- python strip()函数 介绍
- 移动端开发的简单适配方案
- jilu
- 汇编语言: 以下面形式定义一个长整数,其所占用字节数由 N 得到,试编写一个程序,实现对 N 字节的 NUM 的值求补,并把求补后的值仍保存在 NUM 中。
- JBPM(一)---JBPM简介及其开发环境搭建
- Strings of Power
- Android的surfaceView讲解
- 转:typedef函数指针的用法(C++)
- 一个机器学习博士生的忠告
- 关于LDA的一些思考
- 简单实现H5调起手机相机和相册
- gulp前端自动化构建工具新手入门篇
- pthread_create函数创建线程失败的原因
- 在单用户模式下修改CentOS的root密码