Submission #2923369

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <math.h>
#include <string>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
#define INF 100000000000
#define M 1000000007
#define F first
#define S second
#define PB push_back
char s[105];
int n,t1,t2,i,e,c,h;
bool o=true;
int main(void){
    cin>>s;
    n=strlen(s);
    for(int k=0;k<n&&o;k++){
        if(s[k]=='t'){
            if(i>0){
                i--;
                t2++;
            }else t1++;
        }else if(s[k]=='i'){
            if(t1>0){
                t1--;
                i++;
            }else if(t2>0){
                t2--;
                i+=2;
            }else o=false;
        }else if(s[k]=='e'){
            if(t2>0){
                t2--;
                e++;
            }else o=false;
        }else if(s[k]=='c'){
            if(e>0){
                e--;
                c++;
            }else o=false;
        }else if(s[k]=='h'){
            if(c>0){
                c--;
            }else o=false;
        }else o=false;
    }
    if(t1>0||t2>0||i>0||e>0||c>0)o=false;
    if(o)cout<<"Yes\n";
    else cout<<"No\n";
}

Submission Info

Judge Result