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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)


import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) throws FileNotFoundException {

//    Scanner cin = new Scanner(new FileReader("input.txt"));
    Scanner cin = new Scanner(System.in);

    String item = "keyence";
    String in = cin.next();

    int pos = in.indexOf(item);
    int pos2 = in.lastIndexOf(item);
    if (pos==0||pos2==in.length()-item.length()) {
      System.out.println("YES");
      return;
    }

    for (int i=0;i<item.length();i++) {
      String a = item.substring(0,i+1);
      String b = item.substring(i+1,item.length());
      //System.out.println(a);
      //System.out.println(b);
      int posA = in.indexOf(a);
      int posB = in.indexOf(b);

      if (posA==0&&posB==in.length()-b.length()){
        System.out.println("YES");
        return;
      }
      else {
        continue;
      }

    }
    System.out.println("NO");

  }

}