ICPC-UVA
文章平均质量分 85
UVA-OJ题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
UVA10417 Gift Exchanging【概率】
You’re attending a Xmas party, every one there (excepty you, I don’t know why…) has brought a beautiful little gift in a box. After all the gifts are collected and laid on the table, every one can choose one to take home. You are the first one to choose, s原创 2022-05-08 17:37:54 · 439 阅读 · 1 评论 -
UVA11176 Winning Streak【概率】
“You can run on for a long time,sooner or later God’ll cut you down.”— Traditional folk songMikael likes to gamble, and as you know, you can place bets on almost anything these days. A particular thing that has recently caught Mikael’s interest is the l原创 2022-05-08 17:24:46 · 328 阅读 · 0 评论 -
UVA557 LA5578 Burger【概率】
When Mr. and Mrs. Clinton’s twin sons Ben and Bill had their tenth birthday, the party was held at the McDonald’s restaurant at South Broadway 202, New York. There were 20 kids at the party, including Ben and Bill. Ronald McDonald had made 10 hamburgers an原创 2022-05-08 17:04:59 · 301 阅读 · 0 评论 -
UVA11181 Probability|Given【概率+DFS】
N friends go to the local super market together. The probability of their buying something from the market is p1, p2, p3, . . . , pN respectively. After their marketing is finished you are given the information that exactly r of them has bought something a原创 2022-05-08 16:52:50 · 377 阅读 · 0 评论 -
UVA10277 POJ2646 ZOJ1856 Boastin‘ Red Socks【数学】
Boastin’ Red SocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2197 Accepted: 556DescriptionYou have a drawer that is full of two kinds of socks: red and black. You know that there are at least 2 socks, and not more than 50000. However,原创 2022-05-08 16:37:26 · 466 阅读 · 0 评论 -
UVA542 POJ2261 ZOJ1950 France ‘98【概率】
France '98Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1318 Accepted: 791DescriptionToday the first round of the Soccer World Championship in France is coming to an end. 16 countries are remaining now, among which the winner is determine原创 2022-05-08 10:42:04 · 210 阅读 · 0 评论 -
UVA10759 Dice Throwing【概率+DP】
n common cubic dice are thrown. What is the probability that the sum of all thrown dice is at least x?InputThe input file contains several test cases. Each test case consists two integers n (1 ≤ n ≤ 24) and x (0 ≤ x < 150). The meanings of n and x are原创 2022-05-08 09:48:50 · 516 阅读 · 0 评论 -
UVA10236 The Fibonacci Primes【欧拉筛法】
The Fibonacci number sequence is 1, 1, 2, 3, 5, 8, 13 and so on. You can see that except the first two numbers the others are summation of their previous two numbers. A Fibonacci Prime is a Fibonacci number which is relatively prime to all the smaller Fibo原创 2022-04-30 00:36:42 · 859 阅读 · 0 评论 -
UVA10519 Really Strange【大数+递推】
Raju has recently passed BSc. Engineering in Computer Science & Engineering from BUET (Bangladesh University of Extraordinary Talents), the best university of Bangladesh. After passing, he has been appointed manager of BCS (Bangladesh Calculation Socie原创 2022-04-29 08:32:58 · 239 阅读 · 1 评论 -
UVA10254 The Priest Mathematician【大数+递推】
The ancient folklore behind the “Towers of Hanoi” puzzle invented by E. Lucas in 1883 is quite well known to us. One more recent legend tells us that the Brahmin monks from Benares never believed that the world could vanish at the moment they finished to t原创 2022-04-29 07:59:51 · 340 阅读 · 0 评论 -
UVA10328 Coin Toss【DP+大数】
Toss is an important part of any event. When everything becomes equal toss is the ultimate decider. Normally a fair coin is used for Toss. A coin has two sides head(H) and tail(T). Superstition may work in case of choosing head or tail. If anyone becomes w原创 2022-04-29 01:09:47 · 355 阅读 · 0 评论 -
UVA10157 Expressions【大数+递推】
Let X be the set of correctly built parenthesis expressions. The elements of X are strings consisting only of the characters ‘(’ and ‘)’. The set X is defined as follows:• an empty string belongs to X• if A belongs to X, then (A) belongs to X• if both A原创 2022-04-29 00:00:30 · 156 阅读 · 0 评论 -
UVA10247 Complete Tree Labeling【大数+递推】
A complete k-ary tree is a k-ary tree in which all leaves have same depth and all internal nodes have degree k. This k is also known as the branching factor of a tree. It is very easy to determine the number of nodes of such a tree. Given the depth and bra原创 2022-04-28 21:18:57 · 661 阅读 · 0 评论 -
UVA10516 Another Counting Problem【大数+递推】
Tree is an important data structure in Computer Science. Of all trees we work with, Binary Tree is probably the most popular one. A Binary Tree is called Strictly Binary Tree if every nonleaf node in a binary tree has nonempty left and right subtrees. Let原创 2022-04-28 20:42:06 · 242 阅读 · 0 评论 -
UVA10205 POJ2469 ZOJ1896 Stack ‘em Up【水题】
Stack 'em UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1130 Accepted: 411DescriptionA standard playing card deck contains 52 cards, 13 values in each of four suits. The values are named 2, 3, 4, 5, 6, 7, 8, 9, 10, Jack, Queen, King, Ac原创 2022-04-26 14:34:40 · 460 阅读 · 1 评论 -
UVA11125 Arrange Some Marbles【DFS】
you are given some marbles of n different color. You have to arrange these marbles in a line. Themarbles adjacent with same color form a group. In each group there can be 1 to 3 marble. Adjacentgroup should have different color and size. The first and la原创 2022-04-26 13:51:06 · 1016 阅读 · 0 评论 -
UVA10570 Meeting with Aliens【数学计算】
The aliens are in an important meeting just before landing on the earth. All the aliens sit around around table during the meeting. Aliens are numbered sequentially from 1 to N. It’s a precondition ofthe meeting that i’th alien will sit between (i − 1)’t原创 2022-04-25 23:45:04 · 234 阅读 · 0 评论 -
UVA10672 POJ1909 ZOJ2374 Marbles on a tree【BFS】
Marbles on a treeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1890 Accepted: 885Descriptionn boxes are placed on the vertices of a rooted tree, which are numbered from 1 to n, 1 <= n <= 10000. Each box is either empty or contains a原创 2022-04-25 23:06:26 · 318 阅读 · 0 评论 -
POJ3370 UVA11237 HDU1808 Halloween treats【鸽笼原理】
Halloween treatsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11017 Accepted: 3823 Special JudgeDescriptionEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that原创 2021-08-12 08:08:39 · 209 阅读 · 0 评论 -
POJ2528 UVA10587 Mayor‘s posters【线段树】
Mayor’s postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 99829 Accepted: 28528DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at a原创 2021-08-10 18:48:12 · 191 阅读 · 0 评论 -
HDU4111 UVA1500 LA5760 Alice and Bob【SG函数+规律】
Alice and BobTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2540 Accepted Submission(s): 970Problem DescriptionAlice and Bob are very smart guys and they like to play all kinds of games in the原创 2021-08-09 22:41:01 · 258 阅读 · 0 评论 -
UVA10142 Australian Voting【序列处理】
Australian ballots require that the voter rank the candidates in order of choice. Initially only the first choices are counted and if one candidate receives more than 50% of the vote, that candidate is elected. If no candidate receives more than 50%, all c原创 2021-08-05 00:09:05 · 205 阅读 · 0 评论 -
UVA848 Fmt【文本处理】
The unix fmt program reads lines of text, combining and breaking lines so as to create an output file with lines as close to without exceeding 72 characters long as possible. The rules for combining and breaking lines are as follows.• A new line may be st原创 2021-08-04 23:02:26 · 168 阅读 · 0 评论 -
UVA850 Crypt Kicker II【密码译码】
A common but insecure method of encrypting text is to permute the letters of the alphabet. That is, in the text, each letter of the alphabet is consistently replaced by some other letter. So as to ensure that the encryption is reversible, no two letters ar原创 2021-08-03 23:56:19 · 309 阅读 · 0 评论 -
UVA10202 POJ2466 ZOJ1895 Pairsumonious Numbers【算术计算】
Pairsumonious NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1064 Accepted: 521 Special JudgeDescriptionFor 10 > N > 2 numbers we form N*(N-1)/2 sums by adding every pair of the numbers. Your task is to find the N numbers giv原创 2021-08-03 22:50:24 · 233 阅读 · 0 评论 -
UVA10191 Longest Nap【排序】
As you may already know, there are professors very busy with a filled schedule of work during the day. Your professor, let’s call him Professor P, is a bit lazy and wants to take a nap during the day, but as his schedule is very busy, he doesn’t have a lot原创 2021-08-03 13:28:22 · 205 阅读 · 0 评论 -
UVA10360 POJ1916 Rat Attack【枚举】
Rat AttackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 1106 Accepted: 365DescriptionBackgroundBaaaam! Another deadly gas bomb explodes in Manhattan’s underworld. Rats have taken over the sewerage and the city council is doing everything原创 2021-08-03 01:11:54 · 227 阅读 · 0 评论 -
UVA10871 Primed Subsequence【欧拉筛法】
Given a sequence of positive integers of length n, we define a primed subsequence as a consecutive subsequence of length at least two that sums to a prime number greater than or equal to two. For example, given the sequence:3 5 6 3原创 2021-08-02 23:06:04 · 470 阅读 · 0 评论 -
UVA10261 Ferry Loading【DP】
Before bridges were common, ferries were used to transport cars across rivers. River ferries, unlike their larger cousins, run on a guide line and are powered by the river’s current. Two lanes of cars drive onto the ferry from one end, the ferry crosses th原创 2021-08-02 18:49:00 · 522 阅读 · 0 评论 -
UVA11003 Boxes【0-1背包】
We have some boxes numbered 1 to N. The dimensions of all boxes are identical. Now we have to stack up some of the boxes, subject to the following constraints:One cannot put more than one boxes directly upon a box;Boxes with lower serial numbers are not原创 2021-08-02 12:17:58 · 154 阅读 · 0 评论 -
UVA12511 Virus【LCIS】
We have a log file, which is a sequence of recorded events. Naturally, the timestamps are strictly increasing. However, it is infected by a virus, so random records are inserted (but the order of original eve原创 2021-08-02 11:46:21 · 147 阅读 · 0 评论 -
UVA116 HDU1619 Unidirectional TSP【DP】
Unidirectional TSPTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1682 Accepted Submission(s): 803Problem DescriptionProblems that require minimum paths through some domain appear in many diffe原创 2021-08-02 10:14:04 · 197 阅读 · 0 评论 -
UVA1445 LA4636 POJ3802 Cubist Artwork【贪心】
Cubist ArtworkTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 477 Accepted: 308DescriptionInternational Center for Picassonian Cubism is a Spanish national museum of cubist artworks, dedicated to Pablo Picasso. The center held a competition原创 2021-08-01 19:08:51 · 250 阅读 · 0 评论 -
UVA434 Matty‘s Blocks【贪心】
Little Matty liked playing with his blocks very much. He always constructed his ‘buildings’ in the same way: he made stacks of one or more blocks, and he put those stacks on a square table that was exactly K blocks wide (K = 8 for hislargest table, so it原创 2021-08-01 10:16:11 · 220 阅读 · 2 评论 -
UVA11518 HDU2754 Dominos 2【DFS】
Dominos 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 365 Accepted Submission(s): 105Problem DescriptionDominos are lots of fun. Children like to stand the tiles on their side in long lines.原创 2021-07-31 20:23:15 · 208 阅读 · 0 评论 -
UVA10616 Divisible Group Sums【组合+0-1背包】
Given a list of N numbers you will be allowed to choose any M of them. So you can choose in (NM)\tbinom{N}{M}(MN)ways. You will have to determine how many of these chosen groups have a sum, which is divisible by D.InputThe input file contains maximum te原创 2021-07-31 10:28:47 · 180 阅读 · 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 评论 -
UVA11489 Integer Game【简单博弈】
Two players, S and T, are playing a game where they make alternate moves. S plays first. In this game, they start with an integer N. In each move, a player removes one digit from the integer and passes the resulting number to the ot原创 2021-07-24 02:50:00 · 238 阅读 · 1 评论 -
UVA254 Towers of Hanoi【DFS】
In 1883, Edouard Lucas invented, or perhaps reinvented, one of the most popular puzzles of all times – the Tower of Hanoi, as he called it – which is still used today in many computer science textbooks to demonstrate how to write a recursive algorithm or p原创 2021-06-27 19:09:04 · 302 阅读 · 0 评论 -
UVA10998 POJ2857 Flipping Colors【DFS】
Flipping ColorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 749 Accepted: 371DescriptionA rectangle with sides parallel to the x-y axes and its left-lower corner at (0, 0) is being painted. The rectangle may be thought of as a flat-scree原创 2021-06-27 18:04:44 · 230 阅读 · 0 评论