摘要: DescriptionThis problem is a reverse case of theproblem 2996. You are given the output of the problem H and your task is to find the corresponding inp... 阅读全文
posted @ 2014-05-22 13:52 903SW-BAO 阅读(154) 评论(0) 推荐(0) 编辑
摘要: DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down ... 阅读全文
posted @ 2014-05-22 13:49 903SW-BAO 阅读(366) 评论(0) 推荐(0) 编辑
摘要: The first line of input is K, the number of test cases. Each test case starts with one line consisting of two integers, 1 Whereis one ofL: turn lef... 阅读全文
posted @ 2014-05-22 13:47 903SW-BAO 阅读(205) 评论(0) 推荐(0) 编辑
摘要: 亡命逃窜时间限制:1000ms | 内存限制:65535KB难度:4描述 从前有个叫hck的骑士,为了救我们美丽的公主,潜入魔王的老巢,够英雄吧。不过英雄不是这么好当的。这个可怜的娃被魔王抓住了,倍受折磨,生死一线。有一天魔王出去约会了,这可是一个千载难逢的逃命机会。你现在的任务就是判断一下这个英雄... 阅读全文
posted @ 2014-05-22 13:43 903SW-BAO 阅读(193) 评论(0) 推荐(0) 编辑
摘要: 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... 阅读全文
posted @ 2014-05-22 12:29 903SW-BAO 阅读(151) 评论(0) 推荐(0) 编辑
摘要: 本题中最多5个命题变项:p,q,r,s,t每个有0,1两种取值,所以总共32种情况,分别枚举即可。对于每种情况,计算表达式的值,如果有结果为0的则输出not难点在于如何计算表达式的值,我们采用递归的方法,把表达式分为一或两个子表达式,并把参数end(本表达式的结束位置)传给上一层,一遍上一层获取第二... 阅读全文
posted @ 2014-05-22 12:27 903SW-BAO 阅读(161) 评论(0) 推荐(0) 编辑
摘要: DescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.All... 阅读全文
posted @ 2014-05-22 12:23 903SW-BAO 阅读(176) 评论(0) 推荐(0) 编辑
摘要: #include #include using namespace std;int main(){ double n,p; while (cin>>n>>p) cout=1 and an integer p>= 1 you have to write a program t... 阅读全文
posted @ 2014-05-22 12:21 903SW-BAO 阅读(118) 评论(0) 推荐(0) 编辑
摘要: The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refr... 阅读全文
posted @ 2014-05-22 12:10 903SW-BAO 阅读(150) 评论(0) 推荐(0) 编辑
摘要: /*代码一:DFS+Enum*///Memory Time //240K 344MS //本题只要求输出翻转的次数,因此BFS或DFS都适用#includeusing namespace std;bool chess[6][6]={false};//利用的只有中心的4x4bool flag;in... 阅读全文
posted @ 2014-05-22 11:49 903SW-BAO 阅读(208) 评论(0) 推荐(0) 编辑