摘要: ParencodingsTime Limit:1000MSMemory Limit:10000KTotal Submissions:17066Accepted:10221DescriptionLet S = s1 s2...s2n be a well-formed string of parenth... 阅读全文
posted @ 2013-07-30 10:33 SprayT 阅读(177) 评论(0) 推荐(0) 编辑
摘要: Emag eht htiw Em PlehTime Limit:1000MSMemory Limit:65536KTotal Submissions:2312Accepted:1548DescriptionThis problem is a reverse case of theproblem 29... 阅读全文
posted @ 2013-07-30 10:08 SprayT 阅读(222) 评论(0) 推荐(0) 编辑
摘要: Printer QueueTime Limit:1000MSMemory Limit:65536KTotal Submissions:3339Accepted:1815DescriptionThe only printer in the computer science students' unio... 阅读全文
posted @ 2013-07-30 09:56 SprayT 阅读(231) 评论(0) 推荐(0) 编辑