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.
Arch Linux
折腾了四五天，最一开始把Installation guide当成Beginners’ guide，卡在分区那里卡了半天卡不明白（因为前者在分区那一块讲的比后者少的多），笔记本上面的Xorg也装了好久都装不成功，就换家里的台式机试，结果显卡驱动又半天装不上（终于理解Linus为什么要对NVIDIA竖中指了），然后又回过头用自己的Thinkpad试，先是Awesome，再是Openbox，越折腾越头大，最后还是选择直接Gnome全套了，横竖自己8G内存+SSD耗得起也懒得精简那多了，不过略惊喜的是Gnome看起来还是很酷炫的，无论如何也总算是完美着陆了。
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.