08 2014 档案

uva 10325 The Lottery（组合数学-容斥原理）
摘要：The LotteryThe Sports Association of Bangladesh is in great problem with their latest lottery 'Jodi laiga Jai'. There are so many participants this ti... 阅读全文
posted @ 2014-08-25 20:29 炒饭君 阅读(185) 评论(0) 推荐(0)
HDU 4372 Count the Buildings（组合数学-斯特林数,组合数学-排列组合）
摘要：Count the BuildingsProblem DescriptionThere are N buildings standing in a straight line in the City, numbered from 1 to N. The heights of all the buil... 阅读全文
posted @ 2014-08-25 20:18 炒饭君 阅读(257) 评论(0) 推荐(0)
HDU 3240 Counting Binary Trees（组合数学-卡特兰数,数论-整数快速幂,数论-求逆元）
摘要：Counting Binary TreesProblem DescriptionThere are 5 distinct binary trees of 3 nodes:Let T(n) be the number of distinct non-empty binary trees of no m... 阅读全文
posted @ 2014-08-25 14:52 炒饭君 阅读(280) 评论(0) 推荐(0)
uva 11796 Dog Distance （计算几何-点和直线）
摘要：CDog DistanceInputStandard InputOutputStandard OutputTwo dogs, Ranga and Banga, are running randomly following two different paths. They both run forT... 阅读全文
posted @ 2014-08-19 15:23 炒饭君 阅读(246) 评论(0) 推荐(0)
HDU 4902 Nice boat（数据结构-线段树）
摘要：Nice boatProblem DescriptionThere is an old country and the king fell in love with a devil. The devil always asks the king to do some crazy things. Al... 阅读全文
posted @ 2014-08-15 19:14 炒饭君 阅读(188) 评论(0) 推荐(0)
HDU 4021 24 Puzzle （拼图）
摘要：24 PuzzleProblem DescriptionDaniel likes to play a special board game, called 24 puzzle. 24 puzzle is such a game that there are tiles with the number... 阅读全文
posted @ 2014-08-15 19:09 炒饭君 阅读(209) 评论(0) 推荐(0)
HDU 4289 Control （网络流-最小割）
摘要：ControlProblem Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning... 阅读全文
posted @ 2014-08-15 16:16 炒饭君 阅读(148) 评论(0) 推荐(0)
POJ 1185 炮兵阵地（动态规划）
摘要：炮兵阵地Time Limit:2000MSMemory Limit:65536KTotal Submissions:19152Accepted:7417Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表... 阅读全文
posted @ 2014-08-15 16:09 炒饭君 阅读(390) 评论(0) 推荐(0)
POJ 2762 Going from u to v or from v to u? （图论-tarjan）
摘要：Going from u to v or from v to u?Time Limit:2000MSMemory Limit:65536KTotal Submissions:14469Accepted:3801DescriptionIn order to make their sons brave,... 阅读全文
posted @ 2014-08-15 12:07 炒饭君 阅读(154) 评论(0) 推荐(0)
uva 10652 Board Wrapping （计算几何-凸包）
摘要：Problem BBoard WrappingInput:standard inputOutput:standard outputTime Limit:2secondsThe small sawmill in Mission, British Columbia, has developed a br... 阅读全文
posted @ 2014-08-14 11:29 炒饭君 阅读(164) 评论(0) 推荐(0)
uva 11178 Morley's Theorem（计算几何-点和直线）
摘要：Problem DMorley’s TheoremInput:Standard InputOutput:Standard OutputMorley’s theorem states that that the lines trisecting the angles of an arbitrary p... 阅读全文
posted @ 2014-08-13 10:32 炒饭君 阅读(199) 评论(0) 推荐(0)
HDU 4028 The time of a day（动态规划）
摘要：The time of a dayProblem DescriptionThere are no days and nights on byte island, so the residents here can hardly determine the length of a single day... 阅读全文
posted @ 2014-08-12 16:24 炒饭君 阅读(214) 评论(0) 推荐(0)
HDU 4022 Bombing（基本算法-水题）
摘要：BombingProblem DescriptionIt’s a cruel war which killed millions of people and ruined series of cities. In order to stop it, let’s bomb the opponent’s... 阅读全文
posted @ 2014-08-12 16:14 炒饭君 阅读(417) 评论(0) 推荐(0)
HDU 4026 Unlock the Cell Phone（动态规划）
摘要：Unlock the Cell PhoneProblem DescriptionModern high-tech cell phones use unlock patterns to unlock the system. The pattern is usually a 3*3 dot array.... 阅读全文
posted @ 2014-08-12 16:06 炒饭君 阅读(184) 评论(0) 推荐(0)
HDU 4406 GPA（网络流-最大费用流）
摘要：GPAProblem DescriptionGPA(Grade-Point Average) is one way to measure students’ academic performance in PKU. Each course has an integer credit, ranges ... 阅读全文
posted @ 2014-08-11 20:19 炒饭君 阅读(246) 评论(0) 推荐(0)
HDU 4024 Dwarven Sniper’s hunting （计算几何-其它,搜索-二分）
摘要：Dwarven Sniper’s huntingProblem DescriptionNow the hunting starts in the world named DOTA, a stupid PC game which cannot play with others together.Amo... 阅读全文
posted @ 2014-08-11 14:47 炒饭君 阅读(212) 评论(0) 推荐(0)
HDU 4143 A Simple Problem（数论-水题）
摘要：A Simple ProblemProblem DescriptionFor a given positive integer n, please find the smallest positive integer x that we can find an integer y such that... 阅读全文
posted @ 2014-08-11 14:37 炒饭君 阅读(229) 评论(0) 推荐(0)
POJ 2723 Get Luffy Out（图论-2SAT,搜索-二分）
摘要：Get Luffy OutTime Limit:2000MSMemory Limit:65536KTotal Submissions:7488Accepted:2845DescriptionRatish is a young man who always dreams of being a hero... 阅读全文
posted @ 2014-08-08 15:08 炒饭君 阅读(171) 评论(0) 推荐(0)
uva 11478 Halum（图论-差分约束）
摘要：Problem HHalumTime Limit : 3 secondsYou are given a directed graph G(V,E) with a set of vertices and edges. Each edge (i,j) that connects some vertex ... 阅读全文
posted @ 2014-08-08 11:07 炒饭君 阅读(172) 评论(0) 推荐(0)
HDU 4911 Inversion（基本算法-排序,基本算法-分治）
摘要：InversionProblem Descriptionbobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacentnumbers for no more than k times.Find the minimum number ... 阅读全文
posted @ 2014-08-08 09:39 炒饭君 阅读(333) 评论(0) 推荐(0)
POJ 2196 Computer（搜索-深度优先搜索）
摘要：ComputerProblem DescriptionA school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1... 阅读全文
posted @ 2014-08-07 16:39 炒饭君 阅读(176) 评论(0) 推荐(0)
POJ 2455 Secret Milking Machine（搜索-二分,网络流-最大流）
摘要：Secret Milking MachineTime Limit:1000MSMemory Limit:65536KTotal Submissions:9658Accepted:2859DescriptionFarmer John is constructing a new milking mach... 阅读全文
posted @ 2014-08-06 20:15 炒饭君 阅读(146) 评论(0) 推荐(0)
POJ 1274 The Perfect Stall （网络流-最大流）
摘要：The Perfect StallTime Limit:1000MSMemory Limit:10000KTotal Submissions:18308Accepted:8328DescriptionFarmer John completed his new barn just last week,... 阅读全文
posted @ 2014-08-06 16:08 炒饭君 阅读(199) 评论(0) 推荐(0)
POJ 3041 Asteroids （图论-最小点覆盖）
摘要：AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:15079Accepted:8240DescriptionBessie wants to navigate her spaceship through a dangerous... 阅读全文
posted @ 2014-08-06 16:01 炒饭君 阅读(138) 评论(0) 推荐(0)
POJ 2195 Going Home（网络流-费用流）
摘要：Going HomeTime Limit:1000MSMemory Limit:65536KTotal Submissions:17777Accepted:9059DescriptionOn a grid map there are n little men and n houses. In eac... 阅读全文
posted @ 2014-08-06 15:47 炒饭君 阅读(138) 评论(0) 推荐(0)
POJ 3352 Road Construction（图论-tarjan）
摘要：Road ConstructionTime Limit:2000MSMemory Limit:65536KTotal Submissions:8647Accepted:4318DescriptionIt's almost summer time, and that means that it's a... 阅读全文
posted @ 2014-08-05 20:25 炒饭君 阅读(135) 评论(0) 推荐(0)
HDU 3207 Ikki's Story IV - Panda's Trick（图论-2SAT,图论-tarjan）
摘要：Ikki's Story IV - Panda's TrickTime Limit:1000MSMemory Limit:131072KTotal Submissions:7821Accepted:2892Descriptionliympanda, one of Ikki’s friend, lik... 阅读全文
posted @ 2014-08-05 19:24 炒饭君 阅读(182) 评论(0) 推荐(0)
HDU 4309 Seikimatsu Occult Tonneru（网络流-最大流）
摘要：Seikimatsu Occult TonneruProblem DescriptionDuring the world war, to avoid the upcoming Carpet-bombing from The Third Reich, people in Heaven Empire w... 阅读全文
posted @ 2014-08-05 17:51 炒饭君 阅读(179) 评论(0) 推荐(0)
HDU 1098 Ignatius's puzzle（数论-其它）
摘要：Ignatius's puzzleProblem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem ... 阅读全文
posted @ 2014-08-05 14:10 炒饭君 阅读(146) 评论(0) 推荐(0)
uva 11324 The Largest Clique（图论-tarjan,动态规划）
摘要：Problem B: The Largest CliqueGiven a directed graphG, consider the following transformation. First, create a new graphT(G)to have the same vertex set ... 阅读全文
posted @ 2014-08-05 11:19 炒饭君 阅读(229) 评论(0) 推荐(0)
HDU 4005 The war （图论-tarjan）
摘要：The warProblem DescriptionIn the war, the intelligence about the enemy is very important. Now, our troop has mastered the situation of the enemy's war... 阅读全文
posted @ 2014-08-04 16:31 炒饭君 阅读(158) 评论(0) 推荐(0)
HDU 4002 Find the maximum（数论-欧拉函数）
摘要：Find the maximumProblem DescriptionEuler's Totient function, φ (n) [sometimes called the phi function], is used to determine the number of numbers les... 阅读全文
posted @ 2014-08-03 22:59 炒饭君 阅读(190) 评论(0) 推荐(0)
HDU 4007 Dave （基本算法-水题）
摘要：DaveProblem DescriptionRecently, Dave is boring, so he often walks around. He finds that some places are too crowded, for example, the ground. He coul... 阅读全文
posted @ 2014-08-03 22:42 炒饭君 阅读(190) 评论(0) 推荐(0)
HDU 4001 To Miss Our Children Time （动态规划）
摘要：To Miss Our Children TimeProblem DescriptionDo you remember our children time? When we are children, we are interesting in almost everything around ou... 阅读全文
posted @ 2014-08-03 22:31 炒饭君 阅读(166) 评论(0) 推荐(0)
HDU 4004 The Frog's Games（基本算法-贪心,搜索-二分）
摘要：The Frog's GamesProblem DescriptionThe annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the I... 阅读全文
posted @ 2014-08-03 22:15 炒饭君 阅读(253) 评论(0) 推荐(0)
HDU 4006 The kth great number （基本算法-水题）
摘要：The kth great numberProblem DescriptionXiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a numbe... 阅读全文
posted @ 2014-08-03 22:07 炒饭君 阅读(223) 评论(0) 推荐(0)
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 炒饭君 阅读(157) 评论(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 炒饭君 阅读(252) 评论(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 炒饭君 阅读(332) 评论(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)