- 博客(35)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 UVaOJ10085 - The most distant state
10085 - The most distant stateTime limit: 13.333 seconds The 8-puzzle is a square tray in which eight square tiles are placed. The remaining ninth square is uncovered. Each tile has a number
2013-04-28 19:00:39
671
原创 UVaOJ10422 - Knights in FEN
10422 - Knights in FENTime limit: 3.000 seconds There are black and white knights on a 5 by 5 chessboard. There are twelve of each color, and there is one square that is empty. At any time,
2013-04-28 18:59:09
551
原创 UVaOJ10603 - Fill
10603 - FillTime limit: 3.000 secondsThere are three jugs with a volume of a, b and c liters. (a, b, and c are positive integers not greater than 200). The first and the second jug are initi
2013-04-28 18:57:31
535
原创 UVaOJ140 - Bandwidth
140 - BandwidthTime limit: 3.000 secondsGiven a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node v is def
2013-04-28 18:55:42
564
1
原创 UVaOJ167 - The Sultan's Successors
167 - The Sultan's SuccessorsTime limit: 3.000 secondsThe Sultan of Nubia has no children, so she has decided that the country will be split into up to kseparate parts on her death and each pa
2013-04-28 18:54:05
504
原创 UVaOJ165 - Stamps
165 - StampsTime limit: 3.000 secondsThe government of Nova Mareterrania requires that various legal documents have stamps attached to them so that the government can derive revenue from them.
2013-04-28 18:49:15
494
原创 UVaOJ331 - Mapping the Swaps
331 - Mapping the SwapsTime limit: 3.000 secondsSorting an array can be done by swapping certain pairs of adjacent entries in the array. This is the fundamental technique used in the well-know
2013-04-28 18:46:35
529
原创 UVaOJ10344 - 23 out of 5
10344 - 23 out of 5Time limit: 3.000 secondsYour task is to write a program that can decide whether you can find an arithmetic expression consisting of five given numbers (1<=i<=5) that will y
2013-04-28 18:44:53
556
原创 UVaOJ301 - Transportation
301 - TransportationTime limit: 3.000 secondsRuratania is just entering capitalism and is establishing new enterprising activities in many fields including transport. The transportation compan
2013-04-28 18:41:45
597
原创 UVaOJ539 - The Settlers of Catan
539 - The Settlers of CatanTime limit: 3.000 secondsWithin Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities
2013-04-27 18:26:32
501
原创 UVaOJ639---Don't Get Rooked
639 - Don't Get RookedTime limit: 3.000 secondsIn chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards
2013-04-27 18:23:58
503
原创 UVaOJ216---Getting in Line
216 - Getting in LineTime limit: 3.000 secondsComputer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are
2013-04-27 18:20:29
517
原创 UVaOJ10474---Where is the Marble?
10474 - Where is the Marble?Time limit: 3.000 secondsRaju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place t
2013-04-27 17:22:50
675
原创 UVaOJ110---Meta-Loopless Sorts
110 - Meta-Loopless SortsTime limit: 3.000 secondsBackground Sorting holds an important place in computer science. Analyzing and implementing various sorting algorithms forms an importan
2013-04-27 17:19:43
482
原创 UVaOJ729---The Hamming Distance Problem
729 - The Hamming Distance ProblemTime limit: 3.000 secondsThe Hamming distance between two strings of bits (binary integers) is the number of corresponding bit positions that differ. This can
2013-04-15 18:21:44
524
原创 UVaOJ10098---Generating Fast
10098 - Generating FastTime limit: 3.000 seconds Generating permutation has always been an important problem in computer science. In this problem you will have to generate the permutation of
2013-04-15 18:19:20
487
原创 UVaOJ146---ID Codes
146 - ID CodesTime limit: 3.000 secondsIt is 2084 and the year of Big Brother has finally arrived, albeit a century late. In order to exercise greater control over its citizens and thereby to
2013-04-15 18:15:59
11596
原创 UVaOJ131---The Psychic Poker Player
131 - The Psychic Poker PlayerTime limit: 3.000 secondsIn 5-card draw poker, a player is dealt a hand of five cards (which may be looked at). The player may then discard between zero and five
2013-04-15 18:13:47
584
原创 UVaOJ10167---Birthday Cake
10167 - Birthday CakeTime limit: 3.000 secondsBackgroundLucy and Lily are twins. Today is their birthday. Mother buys a birthday cake for them.Now we put the cake onto a Descartes coordina
2013-04-15 18:12:04
459
原创 UVaOJ10305---Ordering Tasks
10305 - Ordering TasksTime limit: 3.000 seconds John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already
2013-04-15 18:09:37
469
原创 UVaOJ10596---Morning Walk
Problem HMorning WalkTime Limit3 Seconds Kamal is a Motashota guy. He has got a new job in Chittagong. So, he has moved to Chittagong from Dinajpur. He was getting fa
2013-04-15 18:07:19
424
原创 UVaOJ10054---The Necklace
10054 - The NecklaceTime limit: 3.000 secondsMy little sister had a beautiful necklace made of colorful beads. Two successive beads in the necklace shared a common color at their meeting point
2013-04-15 18:05:56
634
原创 UVaOJ10129---Play on Words
10129 - Play on WordsTime limit: 3.000 secondsSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no ot
2013-04-15 18:04:02
623
原创 UVaOJ10004---Bicoloring
10004 - BicoloringTime limit: 3.000 secondsIn 1976 the ``Four Color Map Theorem" was proven with the assistance of a computer. This theorem states that every map can be colored using only four
2013-04-15 18:02:39
533
转载 UVaOJ10557---XYZZY
10557 - XYZZYTime limit: 3.000 secondsADVENT: /ad�vent/, n.The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer
2013-04-15 18:00:13
527
原创 UVaOJ532---Dungeon Master
532 - Dungeon MasterTime limit: 3.000 secondsYou are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with ro
2013-04-15 17:56:22
443
原创 UVaOJ439---Knight Moves
439 - Knight MovesTime limit: 3.000 secondsA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits ea
2013-04-15 17:54:23
483
原创 UVaOJ705---Slash Maze
705 - Slash MazeTime limit: 3.000 secondsBy filling a rectangle with slashes (/) and backslashes ( ), you can generate nice little mazes. Here is an example:As you can see, paths in th
2013-04-15 17:52:53
760
原创 UVaOJ784---Maze Exploration
784 - Maze ExplorationTime limit: 3.000 secondsA maze of rectangular rooms is represented on a two dimensional grid as illustrated in figure 1a. Each point of the grid is represented by a char
2013-04-15 17:50:37
734
原创 UVaOJ657---The die is cast
657 - The die is castTime limit: 3.000 secondsInterGames is a high-tech startup company that specializes in developing technology that allows users to play games over the Internet. A market an
2013-04-15 17:48:05
616
原创 UVaOJ572---Oil Deposits
572 - Oil DepositsTime limit: 3.000 secondsThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of l
2013-04-15 17:25:43
433
原创 UVaOJ10562---Undraw the Trees
10562 - Undraw the TreesTime limit: 3.000 seconds Professor Homer has been reported missing. We suspect that his recent research works might have had something to with this. But we really do
2013-04-15 17:22:50
497
原创 UVaOJ839---Not so Mobile
839 - Not so MobileTime limit: 3.000 secondsBefore being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of m
2013-04-15 17:20:38
469
原创 UVaOJ327---Evaluating Simple C Expressions
327 - Evaluating Simple C ExpressionsTime limit: 3.000 secondsThe task in this problem is to evaluate a sequence of simple C expressions, buy you need not know C to solve the problem! Each of
2013-04-15 17:17:55
486
原创 [算法导论]分治法---最大子数组
分治策略---最大自子数组一、分治策略的三个步骤1、分解：将问题划分为一些子问题，子问题的形式与原问题一样，只是规模更小2、解决：递归地求解出子问题。如果子问题的规模足够小，则停止递归，直接求解。3、合并：将子问题的解组合成原问题的解。二、最大子数组问题题目描述：给定义数组A，长度为n，找出数组A中的最大子数组，例如数组A={-23,18,20,-7,12}
2013-04-01 13:33:16
1306
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人