摘要： #include#include#includeusing namespace std;int s[65];int vis[65];int n;int sum;bool DFS(int cur,int index,int num,int single){ if(num==sum/single-1) return true; for(int i=index;isingle) continue; if(cur+s[i]==single) { vis[i]=1; if(DFS(0,0,num+1,single)) return true; v... 阅读全文