Problem:
Score : 200 points

Problem Statement

A string is called a KEYENCE string when it can be changed to keyence by removing its contiguous substring (possibly empty) only once.

Given a string S consisting of lowercase English letters, determine if S is a KEYENCE string.

Constraints

The length of S is between 7 and 100 (inclusive).

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S is a KEYENCE string, print YES; otherwise, print NO.

Sample Input 1

keyofscience

Sample Output 1

YES

keyence is an abbreviation of key of science.

Sample Input 2

mpyszsbznf

Sample Output 2

NO

Sample Input 3

ashlfyha

Sample Output 3

NO

Sample Input 4

keyence

Sample Output 4

YES

Solution in C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <bits/stdc++.h>
using namespace std;
char a[110],b[110];
int main()
{
    scanf("%s",a);
    int len=strlen(a);
    strcpy(b,"keyence");
    int l,flag=0,t,p,q;
    for(int i=0;i<len;i++)
    {
        if(a[i]=='k')
        {
            t=i,l=0;
            while(a[t]==b[l]&&t<len&&l<7) t++,l++;
            if(l==7)
            {
                flag=1;
                break;
            }
            p=t,q=l;
            while(i<len)
            {
                while(a[p]!=b[l]) p++;
                t=p;
                while(a[t]==b[l]&&t<len&&l<7) t++,l++;
                if(l==7) break;
                else q=l;
            }
            if(l==7)
            {
                flag=1;
                break;
            }
        }
    }
    if(flag==1) printf("YES\n");
    else printf("NO\n");
    return 0;
}