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<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
using namespace std;


int main() {
	long long int a, b, c, d, n, m, tmp = 0;
	string str, keye = "keyence";
	cin >> str;
	n = str.length();
	for (int i = 0; i <= 6; i++) {
		for (int j = 0; j < n - 6; j++) {
			for (int k = j +i; k < n + i - 6; k++) {
				tmp = 0;
				for (int p = 0; p < 7; p++) {
					if (p < i) {
						if (str[j + p] == keye[p]) { tmp++; }
					}
					else {
						if (str[k + p - i] == keye[p]) { tmp++; }
					}
				}
				if (tmp == 7) {
					cout << "YES"; return 0;
				}
			}
		}
	}
	cout << "NO";
}