ICPC-UVALive
文章平均质量分 87
UVALive OJ的题解,有关区域赛的赛题题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
POJ2106 LA3094 ZOJ2483 Boolean Expressions【文本处理】
Boolean ExpressionsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7023 Accepted: 2446DescriptionThe objective of the program you are going to produce is to evaluate boolean expressions as the one shown next:Expression: ( V | V ) & F &原创 2022-05-07 19:12:23 · 561 阅读 · 1 评论 -
HDU5972 LA7724 Regular Number【位运算+字符串匹配】
Regular NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3262 Accepted Submission(s): 956Problem DescriptionUsing regular expression to define a numeric string is a very common thing. Gene原创 2021-08-09 00:53:32 · 233 阅读 · 0 评论 -
UVA1482 LA5059 Playing With Stones【SG函数】
You and your friend are playing a game in which you and your friend take turns removing stones from piles. Initially there are N piles with a1, a2, a3, . . . , aN number of stones. On each turn, a player must remove at least one stone from one pile but no原创 2021-07-31 09:01:17 · 175 阅读 · 0 评论 -
POJ1323 LA2521 HDU1338 ZOJ1362 Game Prediction【贪心】
Game PredictionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12596 Accepted: 6053DescriptionSuppose there are M people, including you, playing a special card game. At the beginning, each player receives N cards. The pip of a card is a pos原创 2021-05-20 13:13:24 · 185 阅读 · 0 评论 -
UVA763 LA5339 Fibinary Numbers【大数】
The standard interpretation of the binary number 1010 is 8 + 2 = 10. An alternate way to view the sequence “1010” is to use Fibonacci numbers as bases instead of powers of two. For this problem, the terms of the Fibonacci sequence are:1,2,3,5,8,13,21,...1原创 2021-05-08 00:32:09 · 161 阅读 · 0 评论 -
UVA1226 LA3997 Numerical surprises【大数】
We suspect that for every positive integer N there exists an integer of the form 11 . . . 10 . . . 0 (a sequence of 1’s followed by 0 or more 0’s) that is divisible by N. For example, with N = 3, 111 is divisible by 3, with N = 4, 100 is divisible by 4, wi原创 2021-05-07 23:18:43 · 168 阅读 · 0 评论 -
UVA1224 LA3904 Tile Code【铺砖问题】
The city of Songpa is now carrying out a project to build a bicycle transportation system called green Songpa. By the end of this year, citizens and visitors alike will be able to pick up and drop off bicycles throughout the city. Recently, it was decided原创 2021-05-05 07:24:29 · 224 阅读 · 0 评论 -
UVA356 LA5250 Square Pegs And Round Holes【计算几何】
A circle 2n − 1 units in diameter has been drawn centered on a 2n by 2n chessboard. The construction for n = 3 is illustrated below. Write a program that will determine the number of cells of the board which contain a segment of th原创 2021-05-05 06:29:27 · 296 阅读 · 0 评论 -
UVA263 LA5372 Number Chains【字符串Ad Hoc】
Given a number, we can form a number chain byarranging its digits in descending orderarranging its digits in ascending ordersubtracting the number obtained in (2) from the number obtained (1) to form a new numberand repeat these steps unless the new n原创 2021-05-05 06:14:10 · 277 阅读 · 0 评论 -
UVA280 LA5588 Vertex【DFS】
Write a program that searches a directed graph for vertices which are inaccessible from a given starting vertex. A directed graph is represented by n vertices where 1 ≤ n ≤ 100, numbered consecutively 1 . . . n , and a series of edg原创 2021-05-04 18:00:58 · 387 阅读 · 0 评论 -
UVA296 LA5597 Safebreaker【暴力】
We are observing someone playing the game of Mastermind. The object of this game is to find a secret code by intelligent guess work, assisted by some clues. In this case the secret code is a 4-digit number in the inclusive range from 0000 to 9999, say “332原创 2021-05-03 08:41:02 · 189 阅读 · 0 评论 -
UVA208 WF5147 Firetruck【回溯】
The Center City fire department collaborates with the transportation department to maintain maps of the city which reflects the current status of the city streets. On any given day, several streets are closed for repairs or construction. Firefighters need原创 2021-05-03 07:45:14 · 202 阅读 · 0 评论 -
UVA140 LA5570 Bandwidth【暴力】
Given a graph (V, E) where V is a set of nodes and E is a set of arcs in V ×V , and an ordering on the elements in V , then the bandwidth of a node v is defined as the maximum distance in the ordering between v and any node to which it is connected in the原创 2021-05-01 18:49:23 · 185 阅读 · 0 评论 -
UVA144 LA5572 Student Grants【模拟】
The Government of Impecunia has decided to discourage tertiary students by making the payments of tertiary grants a long and time-consuming process. Each student is issued a student ID card which has a magnetically encoded strip on the back which records t原创 2021-05-01 12:05:01 · 211 阅读 · 0 评论 -
UVA12356 LA5789 Army Buddies【模拟】
Nlogonia is fighting a ruthless war against the neighboring country of Cubiconia. The Chief General of Nlogonia’s Army decided to attack the enemy with a linear formation of soldiers, that would advance together until conquering the neighboring country. Be原创 2021-04-29 00:12:42 · 253 阅读 · 0 评论 -
UVA12150 LA4216 Pole Position【序列处理】
In car races, there is always a high pole next to the finish line of the track. Before the race starts, the pole is used to display the starting grid. The number of the first car in the grid is displayed at the top of the pole, the number of the car in sec原创 2021-04-28 23:34:57 · 257 阅读 · 0 评论 -
UVA665 LA5658 False coin【暴力】
The “Gold Bar” bank received information from reliable sources that in their last group of N coins exactly one coinis false and differs in weight from other coins (while all other coins are equal in weight). After the economic crisis theyhave only a simp原创 2021-04-28 07:50:24 · 291 阅读 · 0 评论 -
HDU5578 LA7405 Friendship of Frog【暴力】
Friendship of FrogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5003 Accepted Submission(s): 2994Problem DescriptionN frogs from different countries are standing in a line. Each country is re原创 2021-04-22 05:47:17 · 308 阅读 · 0 评论 -
UVA12243 LA4810 Flowers Flourish from France【文本处理】
Fiona has always loved poetry, and recently she discovered a fascinating poetical form. Tautograms are a special case of alliteration, which is the occurrence of the same letter at the beginning of adjacent words. In particular, a sentence is a tautogram i原创 2021-04-19 00:25:51 · 193 阅读 · 0 评论 -
UVA12541 LA6148 Birthdates【最值】
Write a program to identify the youngest person and the oldest person in a class.InputThe number n (1 ≤ n ≤ 100) in the first line determines the number of people in a class. The following n lines contain person’s name and his/her birthdate.原创 2021-04-18 22:55:21 · 201 阅读 · 0 评论 -
UVA12543 LA6150 Longest Word【文本处理】
A word is composed of only letters of the alphabet (a-z, A-Z) and may contain one hyphen (-) or more. Given a text containing words, and other characters (punctuations, numbers, symbols, etc), you are to write a program to find the longest word. &nbs原创 2021-04-16 19:31:24 · 230 阅读 · 0 评论 -
UVA12195 LA4481 Jingle Composing【文本处理】
A. C. Marcos is taking his first steps in the direction of jingle composition. He is having some troubles, but at least he is achieving pleasant melodies and attractive rhythms. In music, a note has a pitch (its frequency, resulting原创 2021-04-16 12:33:13 · 249 阅读 · 0 评论 -
UVA201 WF5140 Squares【枚举】
A children’s board game consists of a square array of dots that contains lines connecting some of the pairs of adjacent dots. One part of the game requires that the players count the number of squares of certain sizes that are formed by these lines. For ex原创 2021-04-16 00:05:59 · 239 阅读 · 0 评论 -
UVA12897 LA6917 Decoding Baby Boos【文本处理】
Osantu has been tagged as the best Bangladeshi contestant of present time by many and now he is mostly busy with the sweetest problem of his life — a baby boy. But Osantu often struggles to decode the sound that the baby makes throughout the year and so he原创 2021-04-15 19:53:54 · 187 阅读 · 0 评论 -
UVA13017 LA7274 Canvas Painting【哈夫曼编码】
After last year’s success, Samuel W. E. R. Craft’s fame continues to grow and now he has funds for all kinds of projects that cross his mind. His newest idea involves creating arrays of canvasses with color patterns having no repeated colors. &原创 2021-04-15 13:50:18 · 214 阅读 · 0 评论 -
UVA13015 LA7272 Promotions【拓扑排序】
The Fair Inc. administration decided to promote the best employees and limited the number of promotions to a fixed interval [A, B]. The directors compared the employees’ performance and their evaluations resulted in a consistent precedence relation among e原创 2021-04-15 07:48:41 · 298 阅读 · 1 评论 -
UVA785 LA5281 Grid Colouring【DFS】
A set of contours is represented on a two dimensional grid as illustrated in the sample below. The contours are made of any printable character different than space and ‘’ (underscore). In the sample this character is ‘X’. All the other points of the grid原创 2021-04-12 03:36:11 · 466 阅读 · 0 评论 -
UVA1230 LA4104 MODEX【快速模幂】
Many well-known cryptographic operations require modular exponentiation. That is, given integers x, y and n, compute xy mod n. In this question, you are tasked to program an efficient way to execute this calculation.InputThe input consists of a line cont原创 2021-04-10 18:19:28 · 318 阅读 · 0 评论 -
UVA722 LA5359 Lakes【DFS】
A region of two-dimensional space is divided by a grid into uniform square cells, each of which represents either “land” or “water”. We are interested in finding the area of a region of horizontally or vertically connected “water” c原创 2021-03-27 07:17:22 · 1071 阅读 · 0 评论 -
UVA12583 LA6202 Memory Overflow【水题】
The Great Sultan Mahbub is having some serious issues with his memory. His busy days filled with great works and surrounded by even greater people have brought him to a situation where he has become quite forgetful. For example, he often forgets trivial th原创 2021-03-24 23:30:06 · 301 阅读 · 0 评论 -
UVA1260 LA4843 Sales【逆序数】
Mr. Cooper, the CEO of CozyWalk Co., receives a report of daily sales every day since the company has been established. Starting from the second day since its establishment, on receiving the report, he compares it with each of the previous reports in order原创 2021-03-18 23:22:22 · 270 阅读 · 0 评论 -
UVA617 LA5463 POJ1310 HDU1380 ZOJ1270 Nonstop Travel【序列处理】
Nonstop TravelTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 577 Accepted: 187DescriptionFast Phil works the late shift and leaves his company’s parking lot at precisely 2:00 AM every morning. His route home is by a straight road which has原创 2021-03-18 22:59:30 · 246 阅读 · 0 评论 -
UVA1608 LA6258 Non-boring sequences【分治】
We were afraid of making this problem statement too boring, so we decided to keep it short. A sequence is called non-boring if its every connected subsequence contains a unique element, i.e. an element such that no other element of that subsequence has the原创 2021-03-14 17:09:24 · 228 阅读 · 0 评论 -
POJ1068 LA2338 HDU1361 ZOJ1016 Parencodings【序列处理+括号匹配】
ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 30527 Accepted: 17996DescriptionLet S = s1 s2…s2n be a well-formed string of parentheses. S can be encoded in two different ways:By an integer sequence P = p1 p2…pn where pi is t原创 2021-03-11 05:36:25 · 388 阅读 · 0 评论 -
HDU5974 LA7726 A Simple Math Problem【GCD】
A Simple Math ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 9457 Accepted Submission(s): 2997Problem DescriptionGiven two positive integers a and b,find suitable X and Y to meet the co原创 2021-03-09 19:28:20 · 180 阅读 · 0 评论 -
POJ3484 LA3834 HDU1911 ZOJ3117 Showstopper【二分搜索】
ShowstopperTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3367 Accepted: 1045DescriptionData-mining huge data sets can be a painful and long lasting process if we are not aware of tiny patterns existing within those data sets.One reputabl原创 2021-03-03 18:55:47 · 234 阅读 · 2 评论 -
UVA1174 LA3988 ZOJ3036 IP-TV【Kruskal算法+Prim算法】
IP-TVTime Limit: 5000 msMemory Limit: 32768 KBA consortium of European Internet providers manages a large backbone network, with direct links (connections) between a large number of European cities. A link between a pair of cities is bidirectional. The t原创 2021-03-03 05:55:35 · 306 阅读 · 0 评论 -
UVA821 LA5221 Page Hopping【Floyd算法】
It was recently reported that, on the average, only 19 clicks are necessary to move from any page on the World Wide Web to any other page. That is, if the pages on the web are viewed as nodes in a graph, then the average path length between arbitrary pairs原创 2021-02-27 21:57:48 · 197 阅读 · 0 评论 -
POJ1125 LA2241 ZOJ1082 Stockbroker Grapevine【Floyd算法】
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43263 Accepted: 24230DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockb原创 2021-02-26 09:31:37 · 246 阅读 · 0 评论 -
UVA558 LA5579 Wormholes【Floyd算法】
In the year 2163, wormholes were discovered. A wormhole is a subspace tunnel through space and time connecting two star systems. Wormholes have a few peculiar properties:• Wormholes are one-way only.• The time it takes to travel through a wormhole is neg原创 2021-02-23 00:12:12 · 275 阅读 · 1 评论