即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

Strings of Power

编程语言 zb756999355 15℃ 0评论

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**

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
#include
#include
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;
    }
}

转载请注明:CodingBlog » Strings of Power

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情