razrlele
Codeforces #454 C
Codeforces #454 C C. Little Pony and Expected Maximum time limit per test 1 second memory limit per test 256 megabytes input standard input output
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.
20141230
给自己的工作机换了一张壁纸 清理了一下桌面过后越看越喜欢～ Murphy一直困惑于自己这个看起来不是特别吉利的名字，但是她对于生活的态度却没有真正受其影响，依然对这个世界充满着期待。。。虽然她那个总让她不顺眼的名字就是Cooper起的，但是毋庸置疑，有一个Cooper这样的老爹也是她来到这个星球上最幸运的事情。没有什么事情比从未停止引领着自己发现这个世界的人就是自己最亲近的人更让人感到幸福了。。。就如这张图里面的Murphy微笑地站在老爹面前的，看起来是一种满足，甚至是一种感恩，感恩上天给了她这么赞的一只老爹，站在一个女生的角度来看的话这其中的满足感应该是比我想象的还要多多吧。。。
AOAPC I: Volume 2.Data Structures-Lists
<<算法竞赛入门经典>> UVaoj第三卷数据结构链表习题: 127-“Accordian” Patience UVAOJ127 101-The Blocks Problem UVAOJ101
UVAOJ11234
UVAOJ11234||POJ3367 Expressions Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2591 Accepted: 850 Description Arithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example, (x+y)*(z-w) is an arithmetic expression in infix notation. However, it is easier to write a program to evaluate an expression if the expression is written in postfix notation (also known as reverse Polish notation). In postfix notation, an operator is written behind its two operands, which may be expressions themselves. For example, x y + z w – * is a postfix notation of the arithmetic expression given above. Note that in this case parentheses are not required.
UVAOJ11111
UVAOJ || POJ3195 Generalized Matrioshkas Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1835 Accepted: 538 Description Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two halves, so that one finds another doll inside. Then this doll may be opened to find another one inside it. This can be repeated several times, till a final doll – that cannot be opened – is reached.