![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
POJ
liyingshou
这个作者很懒,什么都没留下…
展开
-
Function Run Fun poj1579
We all love recursion! Don't we? Consider a three-parameter recursive function w(a, b, c): if a 1 if a > 20 or b > 20 or c > 20, then w(a, b, c) returns: w(20, 20, 20) if a w(a,原创 2017-07-28 08:28:45 · 146 阅读 · 0 评论 -
K Best poj3111
Demy has n jewels. Each of her jewels has some value vi and weight wi.Since her husband John got broke after recent financial crises, Demy has decided to sell some jewels. She has decided that she w原创 2017-07-27 08:25:48 · 180 阅读 · 0 评论 -
Knight Moves POJ - 1915
Background Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The Problem Your task is to write原创 2017-08-02 08:20:24 · 184 阅读 · 0 评论 -
poj3126 Prime Path
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter of s原创 2017-08-02 08:52:19 · 154 阅读 · 0 评论 -
poj1068 Parencodings
Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith原创 2017-08-02 15:46:02 · 191 阅读 · 0 评论