#abc323a. A - Weak Beats
A - Weak Beats
Score : points
问题描述
给定一个长度为16的字符串 ,由字符 0
和 1
组成。
如果在从2到16的每个偶数索引 处, 的第 个字符是 0
,则输出 Yes
;否则,输出 No
。
以上为通义千问 qwen-max 翻译,仅供参考。
Problem Statement
You are given a string of length consisting of 0
and 1
.
If the -th character of is 0
for every even number from through , print Yes
; otherwise, print No
.
Constraints
- is a string of length consisting of
0
and1
.
Input
The input is given from Standard Input in the following format:
Output
If the -th character of is 0
for every even number from through , print Yes
; otherwise, print No
.
Sample Input 1
1001000000001010
Sample Output 1
No
The -th character of 1001000000001010
is 1
, so you should print No
.
Sample Input 2
1010100000101000
Sample Output 2
Yes
Every even-positioned character in 1010100000101000
is 0
, so you should print Yes
.
Sample Input 3
1111111111111111
Sample Output 3
No
Every even-positioned character in is 1
. Particularly, they are not all 0
, so you should print No
.
update @ 2024/3/10 01:43:41