题解 | 数组分组

#include <iostream>
using namespace std;

#include<vector>
#include<algorithm>
vector<int>a;
int tt;
int con=0;

void def(int c,int d){
if(c>=a.size()){
if(d==tt){
con=1;
return;
}
else{
    return;
}
}

def(c+1,d);
def(c+1,d+a[c]);

}

int main(){
int n;
cin>>n;
int sum=0;
int sum1=0;
int sum2=0;
for(int i=1;i<=n;i++){

int b;
cin>>b;
sum+=b;
if(b%5==0){
    sum1+=b;

}
else if(b%3==0){
    sum2+=b;
}
else{
    a.push_back(b);
}

}

if(sum%2!=0){
cout<<"false";
}
else{

    int tar=sum/2-sum1;
    tt=tar;

def(0,0);
if(con==1){
    cout<<"true";
}
else{
    cout<<"false";
}
}



    return 0;
}