2013年7月25日

Parencodings（模拟）

摘要： ZOJ Problem Set - 1016ParencodingsTime Limit:2 Seconds Memory Limit:65536 KBLet S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two different ways:By an integer sequence P = p1 p2 ... pn where pi is the number of left parentheses before the ith right parenthesis in S (P 阅读全文

posted @ 2013-07-25 20:56 铁树银花 阅读(352) 评论(0) 推荐(0) 编辑

Do the Untwist（模拟）

摘要： ZOJ Problem Set - 1006Do the UntwistTime Limit:2 Seconds Memory Limit:65536 KBCryptographydeals with methods of secret communication that transform a message (theplaintext) into a disguised form (theciphertext) so that no one seeing the ciphertext will be able to figure out the plaintext except the 阅读全文

posted @ 2013-07-25 17:18 铁树银花 阅读(904) 评论(0) 推荐(0) 编辑

Jugs（回溯法）

摘要： ZOJ Problem Set - 1005JugsTime Limit:2 Seconds Memory Limit:65536 KB Special JudgeIn the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fill the 5-gallon jug with exactly 阅读全文

posted @ 2013-07-25 01:05 铁树银花 阅读(511) 评论(0) 推荐(0) 编辑

导航