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<cstdio>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const char keyence[7] = { 'k','e','y','e','n','c','e' };

int main() {
	char tmp[256] = { 0 };
	bool bStr[7] = { false };
	int iStr[7] = { 0 };
	int Pos = 0;

	scanf("%s", tmp);
	std::string str(tmp);
	if ((7 <= str.size()) && (str.size() <= 100)) {
		for (int i = 0; i < 7; i++) {
			iStr[i] = std::count(str.cbegin(), str.cend(), keyence[i]);
		}
	}

	if ((iStr[0] > 0) && (iStr[1] > 2) && (iStr[2] > 0) && (iStr[4] > 0) && (iStr[5] > 0)) {
		printf("YES\n");
	}
	else {
		printf("NO\n");
	}

	return 0;
}