上一页 1 ··· 51 52 53 54 55 56 57 58 59 ··· 94 下一页

2012年8月31日

POJ 2947 Widget Factory(高斯消元法,解模线性方程组)

摘要: Widget FactoryTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 3412Accepted: 1114DescriptionThe widget factory produces several different kinds of widgets. Each widget is carefully built by a skilled widgeteer. The time required to build a widget depends on its type: the simple widgets need 阅读全文

posted @ 2012-08-31 22:51 kuangbin 阅读(1680) 评论(1) 推荐(1) 编辑

POJ 3185 The Water Bowls(高斯消元)

摘要: The Water BowlsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3340Accepted: 1298DescriptionThe cows have a line of 20 water bowls from which they drink. The bowls can be either right-side-up (properly oriented to serve refreshing cool water) or upside-down (a position which holds no water) 阅读全文

posted @ 2012-08-31 21:52 kuangbin 阅读(727) 评论(0) 推荐(0) 编辑

POJ 1830 开关问题(高斯消元)

摘要: 开关问题Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 4016Accepted: 1399Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果为关就变为开。你的目标是经过若干次开关操作后使得最后N个开关达到一个特定的状态。对于任意一个开关,最多只能进行一次开关操作。你的任务是,计算有多少种可以达到指定状态的方法。(不计开关操作的顺序)Input输入第一行有一个数K,表示以下有K组测 阅读全文

posted @ 2012-08-31 21:37 kuangbin 阅读(1049) 评论(0) 推荐(0) 编辑

POJ 1753 Flip Game(高斯消元)

摘要: Flip GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 20103Accepted: 8710DescriptionFlip game is played on a rectangular 4x4 field with tw... 阅读全文

posted @ 2012-08-31 21:11 kuangbin 阅读(803) 评论(0) 推荐(0) 编辑

POJ 1681 Painter's Problem(高斯消元法)

摘要: Painter's ProblemTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 3441Accepted: 1696DescriptionThere is a square wall which is made of n*n small square bricks. Some bricks are white while some bricks are yellow. Bob is a painter and he wants to paint all the bricks yellow. But there is s 阅读全文

posted @ 2012-08-31 20:16 kuangbin 阅读(2611) 评论(1) 推荐(1) 编辑

POJ 1222 EXTENDED LIGHTS OUT(高斯消元法)

摘要: EXTENDED LIGHTS OUTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 4669Accepted: 3073DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed, that 阅读全文

posted @ 2012-08-31 14:06 kuangbin 阅读(1636) 评论(0) 推荐(0) 编辑

2012年8月30日

HDU 3635 Dragon Balls(并查集)

摘要: Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1201Accepted Submission(s): 484Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gath 阅读全文

posted @ 2012-08-30 21:04 kuangbin 阅读(2940) 评论(1) 推荐(2) 编辑

HDU 4302 Holedox Eating(优先队列或者线段树)

摘要: Holedox EatingTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1830Accepted Submission(s): 634Problem DescriptionHoledox is a small animal which can be considered as one point. It lives in a straight pipe whose length is L. Holedox can only move alo 阅读全文

posted @ 2012-08-30 19:27 kuangbin 阅读(1096) 评论(0) 推荐(0) 编辑

HDU 4301 Divide Chocolate(找规律,DP)

摘要: Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1061Accepted Submission(s): 505Problem DescriptionIt is well known that claire likes dessert very much, especially chocolate. But as a girl she also focuses on the intake of calories e 阅读全文

posted @ 2012-08-30 17:47 kuangbin 阅读(874) 评论(0) 推荐(0) 编辑

HDU 3530 Subsequence(单调队列)

摘要: SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2641Accepted Submission(s): 869Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference betwee 阅读全文

posted @ 2012-08-30 16:00 kuangbin 阅读(1743) 评论(0) 推荐(0) 编辑

上一页 1 ··· 51 52 53 54 55 56 57 58 59 ··· 94 下一页

导航

JAVASCRIPT: