HDU 1258 Sum It Up
2012-01-13 16:17
330 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1258
dfs
View Code
dfs
View Code
#include <stdio.h> #include <string.h> #include <stdlib.h> const int N=20; int a ,n,t,flag; bool vis ; void print() { flag=1; bool bol=0; int i; for (i=1;i<=n;i++) if (vis[i]) { if (bol) printf("+%d",a[i]); else {bol=1; printf("%d",a[i]);} } printf("\n"); } void dfs(int s,int p) { if (s==t) {print(); return;} int i; for (i=p+1;i<=n;i++) { vis[i]=1; if (s+a[i]<=t) dfs(s+a[i],i); vis[i]=0; while (i<=n && a[i]==a[i+1]) i++; } } int main() { int i; while (scanf("%d%d",&t,&n),n||t) { flag=0; for (i=1;i<=n;i++) scanf("%d",&a[i]); printf("Sums of %d:\n",t); dfs(0,0); if (!flag) printf("NONE\n"); } return 0; }
相关文章推荐
- Poj 1564 || HDU 1258 Sum It Up(dfs+技巧)
- HDU 1258 Sum It Up (dfs)
- sum it up hdu 1258
- HDU1258 Sum It Up
- HDu 1258 Sum It Up (还是DFS)
- HDU 1258-Sum It Up(dfs)
- 【DFS】poj 1564 Sum It Up(hdu 1258)
- HDU 1258 Sum It Up (DFS)
- Sum It Up hdu 1258
- HDU 1258 Sum It Up(哈希表判重)
- 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(dfs+去重)
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- hdu 1258 Sum It Up
- (step4.3.4)hdu 1258(Sum It Up——DFS)
- hdu 1258 Sum It Up