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: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
int kvalue[3000];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    string s;
    cin >> s;
    int n = s.size();
    int j = 0;
    string t = "keyence";
    int m = t.size();
    int breaks = 0;
    string answer = "NO\n";
    for(int i = 0 ; i < n; i++)
    {
        if(s[i]!=t[j])
        {
            breaks++;
            if(breaks > 1)
            {
                break;
            }
            while(s[i]!=t[j] && i < n)
            {
                i++;

            }
            i--;
        }
        else
        j++;
        {
            if(j == m)
            {
                answer = "YES\n";
                break;
            }
        }


    }
    cout << answer << "\n";



return 0;}