2014年8月1日
uva 11795 Mega Man's Mission（动态规划-状态压缩DP）
摘要： BMega Man’s MissionsInputStandard InputOutputStandard OutputMega Man is off to save the world again. His objective is to kill the Robots created by Dr... 阅读全文
posted @ 2014-08-01 17:12 炒饭君 阅读(204) 评论(0) 推荐(0)
HDU 2489 Minimal Ratio Tree（数据结构-最小生成树）
摘要： Minimal Ratio TreeProblem DescriptionFor a tree, which nodes and edges are all weighted, the ratio of it is calculated according to the following equa... 阅读全文
posted @ 2014-08-01 15:13 炒饭君 阅读(154) 评论(0) 推荐(0)
HDU 2674 N！Again （数论-水题）
摘要： N！AgainProblem DescriptionWhereIsHeroFrom: Zty, what are you doing ?Zty: I want to calculate N!......WhereIsHeroFrom: So easy! How big N is ?Zty:1 =20... 阅读全文
posted @ 2014-08-01 14:15 炒饭君 阅读(185) 评论(0) 推荐(0)
HDU 3215 The first place of 2^n （数论-水题）
摘要： The first place of 2^nProblem DescriptionLMY and YY are mathematics and number theory lovers. They like to find and solve interesting mathematic probl... 阅读全文
posted @ 2014-08-01 13:49 炒饭君 阅读(251) 评论(0) 推荐(0)
HDU 4864 Task（基本算法-贪心）
摘要： TaskProblem DescriptionToday the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty leve... 阅读全文
posted @ 2014-08-01 13:35 炒饭君 阅读(327) 评论(0) 推荐(0)
POJ 2154 Color（组合数学-波利亚计数,数论-欧拉函数,整数快速幂）
摘要： ColorTime Limit:2000MSMemory Limit:65536KTotal Submissions:7693Accepted:2522DescriptionBeads of N colors are connected together into a circular neckla... 阅读全文
posted @ 2014-08-01 10:19 炒饭君 阅读(206) 评论(0) 推荐(0)