codeforces1230A水题(DFS)

最新推荐文章于 2021-10-27 10:59:54 发布

fisht ank

最新推荐文章于 2021-10-27 10:59:54 发布

阅读量172

点赞数

文章标签：算法 dfs

本文链接：https://blog.csdn.net/weixin_43305294/article/details/104873008

版权

awid has four bags of candies. The i-th of them contains ai candies. Also, Dawid has two friends. He wants to give each bag to one of his two friends. Is it possible to distribute the bags in such a way that each friend receives the same amount of candies in total?

Note, that you can’t keep bags for yourself or throw them away, each bag should be given to one of the friends.

Input
The only line contains four integers a1, a2, a3 and a4 (1≤ai≤100) — the numbers of candies in each bag.

Output
Output YES if it’s possible to give the bags to Dawid’s friends so that both friends receive the same amount of candies, or NO otherwise. Each character can be printed in any case (either uppercase or lowercase).

Examples
Input
1 7 11 5
Output
YES
Input
7 3 2 5
Output
NO
Note
In the first sample test, Dawid can give the first and the third bag to the first friend, and the second and the fourth bag to the second friend. This way, each friend will receive 12 candies.

In the second sample test, it’s impossible to distribute the bags.

#include<iostream>
using namespace std;
int a[6],sum;
bool flag;
void dfs(int x,int d) {
        if(x==sum/2) {
            flag=1;
            return ;
    	}
    if(flag==1) {return ; }
    if(d==5) {return ;}
    dfs(x+a[d],d+1);
    dfs(x,d+1);
}
int main(){
    cin>>a[1]>>a[2]>>a[3]>>a[4];
    sum+=a[1]+a[2]+a[3]+a[4];
    if(sum%2!=0) {
        cout<<"NO"<<endl;
    } else {
    	dfs(0,1);
      	if(flag==1) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }
  return 0;
}

没有什么好说的，这里可以多加一个判断，总和是否为奇数，是就直接输出NO,
看了下别人写的其实也不需要dfs,直接把所有情况列举出来就可以，

using namespace std;
int a[6],sum,temp;
bool flag;
int main(){
    cin>>a[1]>>a[2]>>a[3]>>a[4];
    sum+=a[1]+a[2]+a[3]+a[4];
    if(sum%2!=0) {
        cout<<"NO"<<endl;
    } else {
		if(a[1]+a[2]==sum/2 || a[1]==sum/2 || a[2]==sum/2 || a[3]==sum/2 || a[4]==sum/2 || a[1]+a[3]==sum/2 || a[1]+a[4]==sum/2 || a[2]+a[3]==sum/2 || a[2]+a[4]==sum/2 || a[3]+a[4]==sum/2) {
            cout<<"YES"<<endl;
        } else {
            cout<<"NO"<<endl;
        }
    }
  return 0;
}