UVAOJ297

Written by  on January 29, 2015

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.

[Read more...]

Arch Linux

Written by  on January 26, 2015

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

[Read more...]

20150123

Written by  on January 23, 2015

今夜晚饭还没吃完之时, 老爹牌友就一个电话一个电话接不停地催老爹去赶场子. 老娘:”这么迫不及待? 是有什么事情值得庆祝今天?”

[Read more...]

考试

Written by  on January 19, 2015

现在正在复习Java, 看见那些鬼填空选择抠课本上的概念真是头痛. 反过来看已经考完的三门, 计算机组成原理, 数据库, 计算机网络…哪一门有是有必要闭卷? 难道这年头还规定计算机科学家或者软件工程师平常工作是不允许翻书的么?

[Read more...]

Jay

Written by  on January 18, 2015

今天Jay结婚啊。。。 收到网易云音乐小秘书的推送的歌单,第一首就随机到了《她的睫毛》,瞬间心里面各种滋味就上来了,听了这么多歌,果然还是Jay给了我太多。

[Read more...]

Codeforces #454 C

Written by  on January 15, 2015

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

[Read more...]

20150115

Written by  on January 15, 2015

Anyway, one thing is for sure, you must take responsibility for whatever you have done.

[Read more...]

用DOS分区

Written by  on January 6, 2015

在安装系统的时候,如果用Win7安装程序自带的分区程序分区的话,往往会自动产生一个100M的系统保留隐藏分区,各种逼死OCD, 不过如果用DOS系统分区的话则可以避免这个问题。

[Read more...]

UVAOJ548

Written by  on January 3, 2015

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.

[Read more...]

UVAOJ112

Written by  on January 3, 2015

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.

[Read more...]