炒饭君 - 博客园

2014年8月1日

摘要： 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 炒饭君阅读(141) 评论(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 炒饭君阅读(178) 评论(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 炒饭君阅读(221) 评论(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 炒饭君阅读(304) 评论(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 炒饭君阅读(190) 评论(0) 推荐(0) 编辑

2014年7月31日

uva 10290 {Sum+=i++} to Reach N （数论-整数和素数）

摘要： Problem H{sum+=i++} to Reach NInput:standard inputOutput:standard outputMemory Limit:32 MBAll the positive numbers can be expressed as a sum of one, t... 阅读全文

posted @ 2014-07-31 20:00 炒饭君阅读(198) 评论(0) 推荐(0) 编辑

uva 10168 Summation of Four Primes（数论-哥德巴赫猜想）

摘要： Problem ASummation of Four PrimesInput:standard inputOutput:standard outputTime Limit:4 secondsEuler proved in one of his classic theorems that prime ... 阅读全文

posted @ 2014-07-31 17:42 炒饭君阅读(248) 评论(0) 推荐(0) 编辑

HDU 1695 GCD （数论-整数和素数，组合数学-容斥原理）

摘要： GCDProblem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common d... 阅读全文

posted @ 2014-07-31 17:37 炒饭君阅读(170) 评论(0) 推荐(0) 编辑

HDU 2647 Reward（图论-拓扑排序）

摘要： RewardProblem DescriptionDandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. N... 阅读全文

posted @ 2014-07-31 14:51 炒饭君阅读(125) 评论(0) 推荐(0) 编辑

HDU 3988 Harry Potter and the Hide Story（数论-整数和素数）

摘要： Harry Potter and the Hide StoryProblem DescriptioniSea is tired of writing the story of Harry Potter, so, lucky you, solving the following problem is ... 阅读全文

posted @ 2014-07-31 14:08 炒饭君阅读(321) 评论(0) 推荐(0) 编辑

炒饭君的博客

公告