codeforces 58A Chat room

最新推荐文章于 2021-10-12 11:16:44 发布

原创最新推荐文章于 2021-10-12 11:16:44 发布 · 373 阅读

0 ·

CC 4.0 BY-SA版权

Acm 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个简单的程序，用于判断输入的字符串中是否可以通过删除某些字符来形成单词hello。程序通过递归的方式检查输入字符串，并最终输出判断结果。

A. Chat room

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word "hello". For example, if Vasya types the word "ahhellllloou", it will be considered that he said hello, and if he types "hlelo", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word s.

Input

The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.

Output

If Vasya managed to say hello, print "YES", otherwise print "NO".

Examples

Input

ahhellllloou

Output

YES

Input

hlelo

Output

NO

#include <iostream>
#include <cstring>
using namespace std;
string hello="hello",str;
int len=0;
bool find(int i,int j){
    if(j==5) return 1;
    if(i==len) return 0;
    if(str[i]==hello[j]) find(i+1,j+1);
    else find(i+1,j);
}
int main(){
    while(cin>>str){
        len=str.size();
        if(find(0,0)) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}