Basketball Gym - 100741L （简单dfs）

题目链接：https://vjudge.net/contest/181019#problem/L

题意：A队有n个人，给出每个人对应的值；B队有m个人，给出每个人对应的值。能否从AB队各选出若干人使其值的和相等。

思路：将A队选或不选每个人得的所有和计算出来，B队也是，最后看有多少相等的即可。

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<cstdlib>
#include<sstream>
#include<deque>
#include<stack>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int  maxn = 10000 + 20;
const int  maxt = 300 + 10;
const int mod = 10;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int Dis[] = {-1, 1, -5, 5};
const int inf = 0x3f3f3f3f;
const int MOD = 1000;
int n, m, k;
int num1[maxn], num2[maxn];
vector<ll> ans1, ans2;
void dfs1(int x, ll sum){
    if(x == n){
        if(sum) ans1.push_back(sum); return;
    }
    dfs1(x + 1, sum + (ll)num1[x]);
    dfs1(x + 1, sum);
}
void dfs2(int x, ll sum){
    if(x == m){
        if(sum) ans2.push_back(sum); return;
    }
    dfs2(x + 1, sum + (ll)num2[x]);
    dfs2(x + 1, sum);
}
int main(){
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; ++i){
        scanf("%d", &num1[i]);
    }
    for(int i = 0; i < m; ++i){
        scanf("%d", &num2[i]);
    }
    dfs1(0, 0);
    dfs2(0, 0);
    int len1 = ans1.size(), len2 = ans2.size();
    ll ans = 0;
    for(int i = 0; i < len1; ++i){
        for(int j = 0; j < len2; ++j){
            if(ans1[i] == ans2[j]) ++ans;
        }
    }
    cout << ans << endl;
    return 0;
}