acm
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.
UVAOJ10152
UVAOJ10152 题意: 首先给出一堆栈乌龟, 然后每个乌龟都可以爬到顶端去, 然后求最少爬的次数以及先后顺序以达到目的堆栈乌龟的顺序.
UVAOJ101
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.
AOAPC I: Volume 1.Maths-Simple Geometry
<<算法竞赛入门经典>> UVaoj第二卷计算几何习题: 10250-The Other Two Trees 第一次做到WF的题目(*ﾉωﾉ), 只不过是道热身题…
AOAPC I: Volume 1.Maths-Number Theory
<<算法竞赛入门经典>> UVaoj第二卷数论习题: 575-Skew Binary Skew Binary, 斜进制, 就是一种进制转换的变种. 10110-Light, more light
UVAOJ10061
UVAOJ10061 有一点意思的数论题, 求N!在B进制数系统下的结果的位数以及末尾的零的个数. 求位数比较简单, 因为M位的B进制数最大值为B^M-1, 故
AOAPC I: Volume 1.Maths-Misc
<<算法竞赛入门经典>> UVaoj第二卷数学类习题: 113-Power of Cryptography 这题真是…诶… 一开始发现数值好大所以就各种折腾大数模板, 然后就这样活生生地卡在开方算法那里了…最后实在忍不住搜了搜解题报告, 一看到人家的那个double就想起了double…是可以到2^1024的…