hdu 1258 Sum It Up
2015-05-02 16:48
351 查看
[code] hljs perl">#include<algorithm> #include<string.h> using namespace std; int flag,t,n,a[20],use[20],ans[20]; bool cmp(int x,int y) { return x>y; } void dfs(int sum,int now,int cnt) { int i; if(sum==t) { flag++; printf("%d",ans[0]); for(i=1; i<cnt; i++) { printf("+%d",ans[i]); } printf("\n"); return ; } for(i=now; i<n; i++) { if(use[i]==0) { if(i!=0&&a[i-1]==a[i]&&use[i-1]==0) continue; if(sum+a[i]>t) continue; ans[cnt]=a[i]; use[i]=1; dfs(sum+a[i],i+1,cnt+1); use[i]=0; } } } int main() { int i; while(~scanf("%d%d",&t,&n)) { if(t==0&&n==0) break; for(i=0; i<n; i++) scanf("%d",&a[i]); memset(use,0,sizeof(use)); sort(a,a+n,cmp); flag=0; printf("Sums of %d:\n",t); dfs(0,0,0); if(!flag) printf("NONE\n"); } return 0; }
相关文章推荐
- hdu 1258 Sum It Up
- Sum It Up POJ 1564 HDU 杭电1258【DFS】
- 杭电 HDU 1258 Sum It Up
- HDU1258 Sum It Up
- hdu 1258 Sum It Up(DFS)
- hdu 1258 Sum It Up 搜索
- (step4.3.4)hdu 1258(Sum It Up——DFS)
- HDU 1258 Sum It Up 深搜
- hdu 1258_Sum It Up hdu
- HDU 1258 Sum It Up
- HDU 1258 Sum It Up(Dfs)
- HDU-1258-Sum It Up
- hdu 1258 Sum It Up (dfs+路径记录)
- HDU 1258 Sum It Up
- hdu 1258 Sum It Up
- HDU 1258 Sum It Up
- HDU 1258 Sum It Up
- hdu 1258 Sum It Up(回溯算法)
- HDU 1258 Sum It Up
- hdu-1258-Sum It Up(DFS)