当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1854:Q-Sequence

题目描述
A Q-sequence is defined as:

Q-Seq := 0 or
Q-Seq := Q-seq Q-seq 1

That is to say a Q-Sequence is a single '0' or two Q-Sequences followed by an '1'.

Given a sequence of '0's and '1's, you are to determine whether it is a Q-Sequence.
输入解释
The first line is a number n refers to the number of test cases. Then n lines follows, each line has a string made up of '1's and '0's. The maximum length of the sequence is 1000.
输出解释
The output contain n lines, print "Yes" if it is a Q-sequence, otherwise print "No".
输入样例
3
0010011
0101
00011
输出样例
Yes
No
Yes
来自杭电HDUOJ的附加信息
Author Agreal@TJU
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-1854

最后修改于 2020-10-25T22:48:19+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000/1000MS(Java/Others) 32768/65535K(Java/Others)