二叉树
冰阔落
Stay hungry, Stay foolish, Stop when you are perfect.
展开
-
UVA 297 Quadtrees
#include struct Tnode { char color; Tnode *child[4]; }; Tnode node[1365]; int count; Tnode *deal(char *word, int &move, int a, int b, int *Color) { Tnode *root = &node[count++]; root->color =原创 2014-07-31 18:25:17 · 1627 阅读 · 0 评论 -
UVA 548 Tree
#include int min, leaf; int tree(int root, int *inorder , int *postorder, int sum) { if (root == -1) //无左子结点或右子结点 return 0; int move = root + 1; while (inorder[--move] != postorder[root]); //原创 2014-08-07 10:52:25 · 1616 阅读 · 0 评论 -
UVA 327 Evaluating Simple C Expressions
#include #include int main() { char expre[256]; while (gets(expre)) { printf("Expression: %s\n", expre); int vari[26][2] = {0}, count = 0, sum = 0; for (int i = 0; i < 26; i++) vari[i][原创 2014-08-02 19:02:37 · 1636 阅读 · 0 评论 -
UVA 712 S-Trees
#include #include int main() { int t, count = 0; while (scanf("%d", &t), t) { printf("S-Tree #%d:\n", ++count); getchar(); char tree[200]; gets(tree); gets(tree); int n; scanf("%d",原创 2014-08-01 10:13:37 · 1575 阅读 · 0 评论 -
UVA 10562 Undraw the Trees
#include #include char tree[210][210]; void write(int line, int star) { for (int j = star; line ? tree[line - 1][j] == '-' : j < 209; j++) //如果是 0 行就数到行末, 否者数到不等于 ‘-’; if ( tree[line][j] != ' '原创 2014-08-03 20:28:31 · 1603 阅读 · 0 评论 -
UVA 839 Not so Mobile
#include int judge() { int wl, dl, wr, dr; scanf("%d%d%d%d", &wl, &dl, &wr, &dr); if (wl == 0) wl = judge(); if (wr == 0) wr = judge(); if (wl == 0 || wr == 0) return 0; return wl * dl =原创 2014-08-03 10:37:34 · 1610 阅读 · 0 评论 -
UVA 699 The Falling Leaves
#include int deal(int move, int *arr) { int left; scanf("%d", &left); if (left != -1) { arr[move - 1] += left; deal(move - 1, arr); } int right; scanf("%d", &right); if (right != -1) {原创 2014-08-01 16:58:03 · 1546 阅读 · 0 评论 -
UVA 112 Tree Summing
#include char input() { char temp; temp = getchar(); while (temp == ' ' || temp == '\n') temp = getchar(); return temp; } bool deal(int v, bool *leaf) { bool max = false, l = false, r = fals原创 2014-07-31 11:04:20 · 1653 阅读 · 0 评论