摘要： Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button "UP" , you will go up Ki floor,i.e,you will go t 阅读全文

摘要： Problem DescriptionAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel 阅读全文

摘要： 连连看Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 126 Accepted Submission(s): 63Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意见， 阅读全文

摘要： Problem Description A travelling circus faces a tough challenge in designing the dome for its performances. The circus has a number of shows that happen above the stage in the air under the dome. Various rigs, supports, and anchors must be installed over the stage, but under the dome. The dome itsel 阅读全文

摘要： Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in has a width x, the street he wants to turn to has a width y. The car has a length l and a width d.Can Mr. West go across the corner? Input... 阅读全文

摘要： Problem Description 假设：S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789..................现在我们把所有的串连接起来S = 1121231234.......123456789123456789112345678912.........那么你能告诉我在S串中的第N个数字是多少吗？ Input 输入首先是一个数字K，代表有K次询问。... 阅读全文

摘要： Problem DescriptionThe WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?The radius of the cup's top and bottom circle is known, the cup's height is also known.InputThe input consists of several test c 阅读全文

摘要： Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X.InputThere are many cases. Every data case is described as followed: In the first line there are 阅读全文

摘要： Problem DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several sm 阅读全文

摘要： 看一段英文视频，本来想着学些Natural Language Processing，看完发现原来这就是正则表达式呀，顿感简单呀。所以不要认为什么事情难，去做，去行动吧。不过，我知道对于正则表达式，我还有很长的路要走，对于NLP也是，不过，无所畏惧，又有所畏惧，可以让我们走的更远。学习网站：http://regexpal.com/网站截图：这个网站是练习正则表达式，在线判断正则表达式是否正确的网站。有两个框，下面那个框是文本内容，上面那个框是输入正则表达式的，还有上面三个选项的话，新手就暂时忽略下，（第一个是是否对大小写敏感，第二个是是否识别多行）。使用正则表达式，在我这个新手看来，无非就是文本 阅读全文