LTang

摘要：闲来无事，跑到POJ上找找水题，好久不写C的代码，感觉生疏了。View Code 1 #include<stdio.h> 2 #include<string.h> 3 #define MAXN 19 4 int num[MAXN]; 5 6 void OutputBinaryTree(int n, int k, bool s) { 7 if (n == 0) return; 8 int i, j, sum; 9 for (i = sum = 0, j=num[n-1]; sum + j < k; sum += j, ++i, j = num[i] * num[n- 阅读全文