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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <iostream>
#include <string>

using namespace std;

int main(int argc, char const *argv[])
{
    string S;
    cin >> S;
    string k = "keyence";
    string str1, str2;
    int find1, find2, find3;
    for (int i = 1; i <= 6; i++)
    {
        str1 = k.substr(0, i);
        str2 = k.substr(i, 7 - i);
        find1 = S.find(str1);
        find2 = S.find(str2);
        find3 = S.find(k);
        if ((find1 != string::npos && find2 != string::npos) && (find1 < find2) && (0 == find1) && (S.size() - (7 - i) == find3))
        {
            cout << "YES" << endl;
            return 0;
        }
        if (find3 != string::npos)
        {
            cout << "YES" << endl;
            return 0;
        }

    }

    cout << "NO" << endl;
    
    return 0;
}