GitHub - jzplp/aoapc-UVA-Answer: 算法竞赛入门经典 例题和习题答案 刘汝佳 第二版
AC代码
#include
#includeint sum[100];bool subTree(int p) {int v;if(scanf("%d", &v) <&#61; 0 || v <&#61; 0) {return false;}sum[p] &#43;&#61; v;subTree(p-1);subTree(p&#43;1);return true;
}int main() {int i, n &#61; 0;memset(sum, 0, sizeof(sum));while(subTree(50)) {printf("Case %d:\n", &#43;&#43;n);i &#61; 0;while(sum[i] &#61;&#61; 0) &#43;&#43;i;printf("%d", sum[i&#43;&#43;]);for(; i <100; &#43;&#43;i) {if(sum[i] !&#61; 0) {printf(" %d", sum[i]);}}printf("\n\n");memset(sum, 0, sizeof(sum));}return 0;
}