CF1791A.Codeforces Checking

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

Given a lowercase Latin character (letter), check if it appears in the string $\texttt{codeforces}$ .

The first line of the input contains an integer $t$ ( $1 \leq t \leq 26$ ) — the number of test cases.

The only line of each test case contains a character $c$ — a single lowercase Latin character (letter).

For each test case, output "YES" (without quotes) if $c$ satisfies the condition, and "NO" (without quotes) otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

输入#1

10
a
b
c
d
e
f
g
h
i
j

输出#1

NO
NO
YES
YES
YES
YES
NO
NO
NO
NO