acm
AOAPC I: Volume 2.Data Structures-Binary Trees
<<算法竞赛入门经典>> UVaoj第三卷数据结构二叉树习题: 112-Tree Summing UVAOJ112 548-Tree UVAOJ548 297-Quadtrees UVAOJ297 712-S-Trees
UVAOJ10562
UVAOJ10562 应该是UVa的原因，样例输入的格式显示似乎有一点偏差，其实真正的输入是这样的： Shell
UVAOJ327
UVAOJ327 327 – Evaluating Simple C Expressions Time limit: 3.000 seconds Evaluating Simple C Expressions The task in this problem is to evaluate a sequence of simple C expressions, buy you need not know C to solve the problem! Each of the expressions will appear on a line by itself and will contain no more than 110 characters. The expressions to be evaluated will contain only simple integer variables and a limited set of operators; there will be no constants in the expressions. There are 26 variables which may appear in our simple expressions, namely those with the names a through z(lower-case letters only). At the beginning of evaluation of each expression, these 26 variables will have the integer values 1 through 26, respectively (that is, a = 1, b = 2, …, n = 14, o = 15, …,z = 26). Each variable will appear at most once in an expression, and many variables may not be used at all.
UVAOJ699
UVAOJ699 699 – The Falling Leaves Time limit: 3.000 seconds The Falling Leaves Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing happened to binary trees, how large would the piles of leaves become?
UVAOJ712
UVAOJ712 712 – S-Trees Time limit: 3.000 seconds S-Trees A Strange Tree (S-tree) over the variable set is a binary tree representing a Boolean function . Each path of the S-tree begins at the root node and consists of n+1 nodes. Each of the S-tree’s nodes has a depth, which is the amount of nodes between itself and the root (so the root has depth 0). The nodes with depth less than n are callednon-terminal nodes. All non-terminal nodes have two children: the right child and the left child. Each non-terminal node is marked with some variable xi from the variable set Xn. All non-terminal nodes with the same depth are marked with the same variable, and non-terminal nodes with different depth are marked with different variables. So, there is a unique variable xi1 corresponding to the root, a unique variable xi2 corresponding to the nodes with depth 1, and so on. The sequence of the variables is called the variable ordering. The nodes having depth n are called terminal nodes. They have no children and are marked with either 0 or 1. Note that the variable ordering and the distribution of 0’s and 1’s on terminal nodes are sufficient to completely describe an S-tree.
UVAOJ297
UVAOJ297 297 – Quadtrees Time limit: 3.000 seconds Quadtrees A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be split in four sub quadrants, etc. In the quadtree, the image is represented by a parent node, while the four quadrants are represented by four child nodes, in a predetermined order.
UVAOJ548
UVAOJ548 548 – Tree Time limit: 3.000 seconds Tree You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum of values of nodes along that path.
UVAOJ112
UVAOJ112 112 – Tree Summing Time limit: 3.000 seconds Tree Summing Background LISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are the fundamental data structures in LISP, can easily be adapted to represent other important data structures such as trees.
AOAPC I: Volume 2.Data Structures-Lists
<<算法竞赛入门经典>> UVaoj第三卷数据结构链表习题: 127-“Accordian” Patience UVAOJ127 101-The Blocks Problem UVAOJ101