Volume3-高效算法设计
文章平均质量分 80
c随遇er安
上得了厅堂 下得了厨房 写得了代码 把得了姑娘 小清醒Coder一枚
展开
-
UVaOJ10905 - Children's Game
4th IIUC Inter-University Programming Contest, 2005AChildren’s GameInput: standard inputOutput: standard outputProblemsetter: Md. KamruzzamanThere are原创 2013-05-23 19:03:31 · 542 阅读 · 0 评论 -
UVaOJ10382 - Watering Grass
10382 - Watering GrassTime limit: 3.000 secondsn sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is installed at the horizontal center l原创 2013-05-25 18:01:51 · 605 阅读 · 0 评论 -
UVaOJ10720 - Graph Construction
Problem CGraph ConstructionTime Limit2 SecondsGraph is a collection of edges E and vertices V. Graph has a wide variety of applications in computer. There are different原创 2013-05-25 18:05:01 · 470 阅读 · 0 评论 -
UVaOJ10716 - Evil Straw Warts Live
Problem D: Evil Straw Warts LiveA palindrome is a string of symbols that is equal to itself when reversed. Given an input string, not necessarily a palindrome, compute the number of swaps necessary原创 2013-05-25 18:06:38 · 996 阅读 · 0 评论 -
UVaOJ11100 - The Trip, 2007
Problem A: The Trip, 2007A number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadel原创 2013-05-25 18:07:50 · 686 阅读 · 0 评论 -
UVaOJ11129 - An antiarithmetic permutation
11129 - An antiarithmetic permutationTime limit: 3.000 secondsA permutation of n+1 is a bijective function of the initial n+1 natural numbers: 0, 1, ... n. A permutation p is called antiarithm原创 2013-05-25 18:10:47 · 647 阅读 · 0 评论 -
UVaOJ108 - Maximum Sum
108 - Maximum SumTime limit: 3.000 secondsBackgroundA problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. Consider satisfying原创 2013-05-25 18:14:17 · 480 阅读 · 0 评论 -
UVaOJ11054 - Wine trading in Gergovia
2006/2007 ACM International Collegiate Programming Contest University of Ulm Local ContestWine trading in GergoviaAs you may know from the comic "Asterix and the Chieftain's Shield", Gergovi原创 2013-05-25 18:00:19 · 509 阅读 · 0 评论 -
UVaOJ507 - Jill Rides Again
507 - Jill Rides AgainTime limit: 3.000 secondsJill likes to ride her bicycle, but since the pretty city of Greenhills where she lives has grown, Jill often uses the excellent public bus syste原创 2013-05-25 18:13:01 · 763 阅读 · 0 评论 -
UVaOJ10400 - Game Show Math
10400 - Game Show MathTime limit: 20.000 secondsA game show in Britain has a segment where it gives its contestants a sequence of positive numbers and a target number. The contestant must make原创 2013-05-25 17:58:02 · 534 阅读 · 0 评论 -
UVaOJ10718 - Bit Mask
Problem ABit MaskTime Limit1 SecondIn bit-wise expression, mask is a common term. You can get a certain bit-pattern using mask. For example, if you want to make first原创 2013-05-25 17:59:11 · 639 阅读 · 0 评论 -
UVaOJ10670 - Work Reduction
Problem C: Work ReductionPaperwork is beginning to pile up on your desk, and tensions at the workplace are starting to mount. Your boss has threatened to fire you if you don't make any progress by原创 2013-05-25 18:03:51 · 535 阅读 · 0 评论 -
UVaOJ10602 - Editor Nottoobad
10602 - Editor NottoobadTime limit: 3.000 secondsCompany Macrohard has released it’s new version of editor Nottoobad, which can understand a few voice commands. Unfortunately, there are only原创 2013-05-23 19:26:55 · 453 阅读 · 0 评论 -
UVaOJ10954 - Add All
10954 - Add AllTime limit: 3.000 secondsYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++ program just to add a s原创 2013-05-23 19:25:21 · 470 阅读 · 0 评论 -
UVaOJ10763 - Foreign Exchange
10763 - Foreign ExchangeTime limit: 3.000 secondsYour non-profit organization (iCORE - international Confederation of Revolver Enthusiasts) coordinates a very successful foreign student exchan原创 2013-05-23 19:05:04 · 674 阅读 · 1 评论 -
UVaOJ10132 - File Fragmentation
10132 - File FragmentationTime limit: 3.000 secondsYour friend, a biochemistry major, tripped while carrying a tray of computer files through the lab. All of the files fell to the ground and b原创 2013-05-23 19:06:43 · 667 阅读 · 0 评论 -
UVaOJ270 - Lining Up
270 - Lining UpTime limit: 3.000 seconds``How am I ever going to solve this problem?" said the pilot.Indeed, the pilot was not facing an easy task. She had to drop packages at specific poi原创 2013-05-23 19:08:14 · 734 阅读 · 1 评论 -
UVaOJ10341 - Solve It
10341 - Solve ItTime limit: 3.000 secondsSolve the equation: p*e-x + q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0 where 0 x InputInput consists of multiple test cases an原创 2013-05-23 19:10:05 · 419 阅读 · 0 评论 -
UVaOJ10057 - A mid-summer night's dream.
10057 - A mid-summer night's dream.Time limit: 30.000 seconds This is year 2200AD. Science has progressed a lot in two hundred years. Two hundred years is mentioned here because this problem原创 2013-05-23 19:11:21 · 619 阅读 · 0 评论 -
UVaOJ10706 - Number Sequence
10706 - Number SequenceTime limit: 3.000 secondsA single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groupsS1S2…Sk. Each原创 2013-05-23 19:12:47 · 454 阅读 · 0 评论 -
UVaOJ10487 - Closest Sums
10487 - Closest SumsTime limit: 3.000 seconds Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of two distinct numbers from the set,原创 2013-05-23 19:14:07 · 445 阅读 · 0 评论 -
UVaOJ10340 - All in All
10340 - All in AllTime limit: 3.000 secondsYou have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. B原创 2013-05-23 19:15:44 · 651 阅读 · 0 评论 -
UVaOJ10700 - Camel trading
10700 - Camel tradingTime limit: 3.000 secondsBackground:Aroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula 1+2*3*4+5, which had its origin in the financial accounts of a原创 2013-05-23 19:19:42 · 489 阅读 · 0 评论 -
UVaOJ10026 - Shoemaker's Problem
10026 - Shoemaker's ProblemTime limit: 3.000 secondsShoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ith job, it is kno原创 2013-05-23 19:20:57 · 609 阅读 · 0 评论 -
UVaOJ10020 - Minimal coverage
10020 - Minimal coverageTime limit: 3.000 secondsThe ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such the原创 2013-05-23 19:22:06 · 489 阅读 · 0 评论 -
UVaOJ10714 - Ants
Problem B: AntsAn army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two原创 2013-05-23 19:23:50 · 483 阅读 · 0 评论 -
UVaOJ10245 - The Closest Pair Problem
10245 - The Closest Pair ProblemTime limit: 3.000 seconds Given a set of points in a two dimensional space, you will have to find the distance between the closest two points. Input T原创 2013-05-25 18:09:24 · 531 阅读 · 0 评论