Q - ACM ICPC

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 6students who wished to participate, the decision was to build exactly two teams.

After practice competition, participant number i got a score of aiTeam 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.

Input

The single line contains six integers a1, ..., a6 (0 ≤ ai ≤ 1000) — scores of the participants

Output

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").

Example
Input
1 3 2 1 2 1
Output
YES
Input
1 1 1 1 1 99
Output
NO
Note

In the first sample, first team can be composed of 1st, 2nd and 6th participant, second — of 3rd, 4th and 5th: 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.

思路:把给定的人分成两组得分相同的组,首先总分肯定是能被2整除,然后就暴力的遍历一遍,看是否存在相应的数据

#include<iostream>
using namespace std;
int main()
{
int a[6];
int sum = 0;
for (int i = 0; i < 6; i++)
{
cin >> a[i];
sum += a[i];
}
if (sum % 2 != 0)
{
cout << "NO" << endl;
return 0;
}
int flag = 0;
for (int i = 0; i < 4; ++i)
{
for (int j = i + 1; j < 5; ++j)
{
for (int k = j + 1; k < 6; ++k)
{
if ((a[i] + a[j] + a[k]) == (sum / 2))
{
flag = 1;
break;
}
}
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值