CF1671A.String Building
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given a string s . You have to determine whether it is possible to build the string s out of strings aa, aaa, bb and/or bbb by concatenating them. You can use the strings aa, aaa, bb and/or bbb any number of times and in any order.
For example:
- aaaabbb can be built as aa + aa + bbb;
- bbaaaaabbb can be built as bb + aaa + aa + bbb;
- aaaaaa can be built as aa + aa + aa;
- abab cannot be built from aa, aaa, bb and/or bbb.
输入格式
The first line contains one integer t ( 1≤t≤1000 ) — the number of test cases.
Each test case consists of one line containing the string s ( 1≤∣s∣≤50 ), consisting of characters a and/or b.
输出格式
For each test case, print YES if it is possible to build the string s . Otherwise, print NO.
You may print each letter in any case (for example, YES, yes, Yes will all be recognized as positive answer, NO, no and nO will all be recognized as negative answer).
输入输出样例
输入#1
8 aaaabbb bbaaaaabbb aaaaaa abab a b aaaab bbaaa
输出#1
YES YES YES NO NO NO NO YES
说明/提示
The first four test cases of the example are described in the statement.