摘要:
#includeint num[12];int sums[12];int n,m;int flog,flag;void DFS(int i,int sum){ int j; if(i>=m)return; if(i>0) if(num[i]==num[i-1]&&sums[i-1]==0) { DFS(i+1,sum); return; } sums[i]=1; if(sum+num[i]==n) { flog=0;j=i; for(j=0;j<m;j++) { if(sums[j]){if(flog)printf("+");printf( 阅读全文