A11438 | ACM ICPC
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
In a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as possible, but since there were only $6$ students who wished to participate, the decision was to build exactly two teams.
After practice competition, participant number $i$ got a score of $a_{i}$ . Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.
After practice competition, participant number $i$ got a score of $a_{i}$ . Team score is defined as sum of scores of its participants. High school management is interested if it's possible to build two teams with equal scores. Your task is to answer that question.
输入格式
The single line contains six integers $a_{1},...,a_{6}$ ( $0<=a_{i}<=1000$ ) — scores of the participants
输出格式
Print "YES" (quotes for clarity), if it is possible to build teams with equal score, and "NO" otherwise.
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES").
输入输出样例
输入 #1
1 3 2 1 2 1
输出 #1
YES
输入 #2
1 1 1 1 1 99
输出 #2
NO
In the first sample, first team can be composed of $1$ st, $2$ nd and $6$ th participant, second — of $3$ rd, $4$ th and $5$ th: team scores are $1+3+1=2+1+2=5$ .
In the second sample, score of participant number $6$ is too high: his team score will be definitely greater.
In the second sample, score of participant number $6$ is too high: his team score will be definitely greater.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted