A10556 | Fashion in Berland
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
According to rules of the Berland fashion, a jacket should be fastened by all the buttons except only one, but not necessarily it should be the last one. Also if the jacket has only one button, it should be fastened, so the jacket will not swinging open.
You are given a jacket with $n$ buttons. Determine if it is fastened in a right way.
You are given a jacket with $n$ buttons. Determine if it is fastened in a right way.
输入格式
The first line contains integer $n$ ( $1<=n<=1000$ ) — the number of buttons on the jacket.
The second line contains $n$ integers $a_{i}$ ( $0<=a_{i}<=1$ ). The number $a_{i}=0$ if the $i$ -th button is not fastened. Otherwise $a_{i}=1$ .
The second line contains $n$ integers $a_{i}$ ( $0<=a_{i}<=1$ ). The number $a_{i}=0$ if the $i$ -th button is not fastened. Otherwise $a_{i}=1$ .
输出格式
In the only line print the word "YES" if the jacket is fastened in a right way. Otherwise print the word "NO".
输入输出样例
输入 #1
3 1 0 1
输出 #1
YES
输入 #2
3 1 0 0
输出 #2
NO
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted