2011 年 8月 6 日随笔档案 - kuangbin

ACM POJ 2421 Constructing Roads（简单最小生成树）

摘要： Constructing RoadsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 14128Accepted: 5682DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only 阅读全文

posted @ 2011-08-06 19:45 kuangbin 阅读(546) 评论(0) 推荐(0)

ACM POJ 1258 Agri-Net （简单最小生成树）

摘要： Agri-NetTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22951Accepted: 9047DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course. Farmer John ordered a high speed con 阅读全文

posted @ 2011-08-06 19:38 kuangbin 阅读(535) 评论(0) 推荐(0)

ACM HDU 1283 最简单的计算机（简单水题）

摘要：最简单的计算机Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1781Accepted Submission(s): 1054Problem Description一个名叫是PigHeadThree的研究组织设计了一台实验用的计算机，命名为PpMm。PpMm只能执行简单的六种命令A，B，C，D，E，F；只有二个内存M1，M2；三个寄存器R1，R2，R3。六种命令的含义如下：命令A：将内存M1的数据装到寄存器R1中；命令B：将内存M2的数据装到寄阅读全文

posted @ 2011-08-06 14:42 kuangbin 阅读(1948) 评论(0) 推荐(0)

ACM HDU 1282 回文数猜想（简单水题）

摘要：回文数猜想Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1524Accepted Submission(s): 945Problem Description一个正整数，如果从左向右读（称之为正序数）和从右向左读（称之为倒序数）是一样的，这样的数就叫回文数。任取一个正整数，如果不是回文数，将该数与他的倒序数相加，若其和不是回文数，则重复上述步骤，一直到获得回文数为止。例如：68变成154（68+86），再变成605（154+451），最后变成1 阅读全文

posted @ 2011-08-06 14:32 kuangbin 阅读(3539) 评论(0) 推荐(0)

ACM HDU 1279 验证角谷猜想（简单水题）

摘要：验证角谷猜想Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2209Accepted Submission(s): 1137Problem Description数论中有许多猜想尚未解决，其中有一个被称为“角谷猜想”的问题，该问题在五、六十年代的美国多个著名高校中曾风行一时，这个问题是这样描述的：任何一个大于一的自然数，如果是奇数，则乘以三再加一；如果是偶数，则除以二；得出的结果继续按照前面的规则进行运算，最后必定得到一。现在请你编写一个程序验阅读全文

posted @ 2011-08-06 14:18 kuangbin 阅读(2175) 评论(0) 推荐(0)

HDU 1266 Reverse Number （很简单的水题）

摘要： Reverse NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2047Accepted Submission(s): 926Problem DescriptionWelcome to 2006'4 computer college programming contest!Specially, I give my best regards to all freshmen! You are the future of HDU 阅读全文

posted @ 2011-08-06 14:08 kuangbin 阅读(818) 评论(0) 推荐(0)

ACM HDU 1248 寒冰王座（水题，用母函数完成的）

摘要：寒冰王座Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4537Accepted Submission(s): 2151Problem Description不死族的巫妖王发工资拉,死亡骑士拿到一张N元的钞票(记住,只有一张钞票),为了防止自己在战斗中频繁的死掉,他决定给自己买一些道具,于是他来到了地精商店前.死亡骑士:"我要买道具!"地精商人:"我们这里有三种道具,血瓶150块一个,魔法药200块一个,无敌药水3 阅读全文

posted @ 2011-08-06 13:40 kuangbin 阅读(797) 评论(0) 推荐(0)

ACM HDU 1142 A Walk Through the Forest（单源最短路，记忆DFS）

摘要： A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2121Accepted Submission(s): 756Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a 阅读全文

posted @ 2011-08-06 12:28 kuangbin 阅读(494) 评论(0) 推荐(0)

ACM HDU 1217 Arbitrage(Floyed算法）

摘要： ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1186Accepted Submission(s): 547Problem DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same curr 阅读全文

posted @ 2011-08-06 02:25 kuangbin 阅读(2698) 评论(0) 推荐(3)

ACM HDU 1301 Jungle Roads （简单最小生成树问题）

摘要： Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1728Accepted Submission(s): 1254Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages 阅读全文

posted @ 2011-08-06 01:01 kuangbin 阅读(583) 评论(0) 推荐(0)