20141230

Written by  on December 30, 2014

给自己的工作机换了一张壁纸 清理了一下桌面过后越看越喜欢~ Murphy一直困惑于自己这个看起来不是特别吉利的名字,但是她对于生活的态度却没有真正受其影响,依然对这个世界充满着期待。。。虽然她那个总让她不顺眼的名字就是Cooper起的,但是毋庸置疑,有一个Cooper这样的老爹也是她来到这个星球上最幸运的事情。没有什么事情比从未停止引领着自己发现这个世界的人就是自己最亲近的人更让人感到幸福了。。。就如这张图里面的Murphy微笑地站在老爹面前的,看起来是一种满足,甚至是一种感恩,感恩上天给了她这么赞的一只老爹,站在一个女生的角度来看的话这其中的满足感应该是比我想象的还要多多吧。。。

[Read more...]

AOAPC I: Volume 2.Data Structures-Lists

Written by  on December 27, 2014

<<算法竞赛入门经典>> UVaoj第三卷数据结构链表习题: 127-“Accordian” Patience UVAOJ127 101-The Blocks Problem UVAOJ101

[Read more...]

UVAOJ11234

Written by  on December 26, 2014

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.

[Read more...]

UVAOJ11111

Written by  on December 26, 2014

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.

[Read more...]

POJ1840

Written by  on December 20, 2014

POJ1840 Eqs Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 14507 Accepted: 7122 Description Consider equations having the following form:

[Read more...]

UVAOJ10152

Written by  on December 20, 2014

UVAOJ10152 题意: 首先给出一堆栈乌龟, 然后每个乌龟都可以爬到顶端去, 然后求最少爬的次数以及先后顺序以达到目的堆栈乌龟的顺序.

[Read more...]

20141214

Written by  on December 14, 2014

唔…最近过得还算不错, 或者这一个学期都过得还算爽, 虽然刷题速度还没能突破两题/天, 但是也没有去想强迫自己质疑自己了, 或者说已经坦然接受了自己水平还没到家所以速度上不去这个事实, 常规题到手随手1A这个离我还有一定距离的我只能承认, 随着这几年慢慢变大, 我已经渐渐地发现自己过去大跃进思想尤其根深蒂固, 以前尽管几乎每次的初衷都是好的, 但是结果都是不好的, 说白了就是不踏实, 干什么都想一步登天, 不懂得为过程而努力和享受过程.

[Read more...]

UVAOJ101

Written by  on December 14, 2014

UVAOJ101 101 – The Blocks Problem Time limit: 3.000 seconds   The Blocks Problem  Background  Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world in which a robot arm performed tasks involving the manipulation of blocks.

[Read more...]

UVAOJ127

Written by  on December 13, 2014

UVAOJ127 127 – “Accordian” Patience Time limit: 3.000 seconds  Accordian” Patience  You are to simulate the playing of games of Accordian” patience, the rules for which are as follows:

[Read more...]

Strange#0

Written by  on December 12, 2014

Update0 刚刚才发现在另外一台电脑上面, 同样的程序, 同样的数据, 代码却是在pilecount == 33, i == 4的时候出现Segment Fault, 并且i最终变成的是18474…

[Read more...]