# 20141230

Written by  on December 30, 2014

# AOAPC I: Volume 2.Data Structures-Lists

Written by  on December 27, 2014

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

# 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.

# 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.

# 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:

# UVAOJ10152

Written by  on December 20, 2014

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

# 20141214

Written by  on December 14, 2014

# 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.

# 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: