![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
贪心
滑头鬼之亨
Frankiller
展开
-
uva 10785 - The Mad Numerologist
The Mad Numerologist Numerology is a science that is used by many people to find out a mans personality, sole purpose of life, desires to experience etc. Some calculations of numerology ar原创 2012-06-14 12:30:54 · 752 阅读 · 0 评论 -
uva 11100 - 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原创 2012-09-08 09:40:51 · 3279 阅读 · 1 评论 -
uva 10020 - Minimal coverage
Minimal coverageThe ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover th原创 2012-09-06 21:32:36 · 3318 阅读 · 0 评论 -
uva 10954 - Add All
Problem FAdd AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++原创 2012-08-27 20:45:38 · 2141 阅读 · 0 评论 -
uva 311 - Packets
PacketsA factory produces products packed in square packets of the same height h and of the sizes , , , , , . These products are always delivered to customers in the square p原创 2012-09-06 19:04:21 · 2522 阅读 · 0 评论 -
uva 10382 - Watering Grass
Problem EWatering GrassInput: standard inputOutput: standard outputTime Limit: 3 secondsn sprinklers are installed in a horizontal strip of grassl meters long and w meters wide. Each s原创 2012-09-05 21:29:41 · 1574 阅读 · 0 评论 -
uva 10718 - 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 4原创 2012-09-05 19:20:04 · 829 阅读 · 0 评论 -
uva 11054 - 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原创 2012-09-05 19:32:01 · 1091 阅读 · 0 评论 -
uva 10026 - Shoemaker's Problem
Shoemaker's ProblemShoemaker 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 known the integer Ti (1i<=1000),原创 2012-09-03 21:53:01 · 1940 阅读 · 0 评论 -
uva 993 - Product of digits
Product of digitsFor a given non-negative integer number N , find the minimal naturalQ such that the product of all digits of Q is equal N . InputThe first line of input co原创 2012-09-03 21:02:05 · 1187 阅读 · 0 评论 -
uva 10700 - Camel trading
Problem E - Camel tradingTime Limit: 1 secondBackground 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原创 2012-08-24 10:33:29 · 1263 阅读 · 0 评论 -
uva 10340 - All in All
Problem EAll in AllInput:standard inputOutput:standard outputTime Limit: 2 secondsMemory Limit:32 MBYou have devised a new encryption technique which encodes a message by inserting b原创 2012-08-23 17:13:58 · 923 阅读 · 0 评论 -
uva 10132 - File Fragmentation
Question 2: File FragmentationThe ProblemYour friend, a biochemistry major, tripped while carrying a tray of computer files through the lab. All of the files fell to the ground and broke. Your fri原创 2012-08-21 16:12:44 · 923 阅读 · 0 评论 -
uva 10905 - Children's Game
4thIIUCInter-University Programming Contest, 2005AChildren’s GameInput: standard inputOutput: standard outputProblemsetter: Md. KamruzzamanThere a原创 2012-08-20 09:47:04 · 1241 阅读 · 0 评论 -
uva 714 - Copying Books
Copying BooksBefore the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so calledscribers. The scriber had been gi原创 2012-10-08 20:51:42 · 2897 阅读 · 0 评论