摘要：HDU4219 Randomization?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 95Accepted Submission(s): 37Problem DescriptionRandom is the real life. What we see and sense everyday are absolutely randomly happened. Randomization is the process of making so 阅读全文

摘要：UESTC1565 Smart TypistTime Limit:2000 msMemory Limit:65536 kBSolved:10Tried:49DescriptionThe most mysterious organization in Chani is “Related Department”. It is related to almost everything, and has branches almost everywhere. Events always have relation with it. Whenever disasters happen, “Related 阅读全文

摘要：HDU3578 Greedy TinoTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 862Accepted Submission(s): 295Problem DescriptionTino wrote a long long story. BUT! in Chinese...So I have to tell you the problem directly and discard his long long story. That is 阅读全文

摘要：HDU3828 A + B problemTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 544Accepted Submission(s): 116Problem DescriptionQQ and OO always play the game of A + B. QQ gives tow decimal number A and B, and OO answers the sum at once. But to do the same 阅读全文

摘要：POJ1793&&EOJ21 Software CompanyTime Limit:1000MSMemory Limit:30000KTotal Submissions:864Accepted:348DescriptionA software developing company has been assigned two programming projects. As both projects are within the same contract, both must be handed in at the same time. It does not help if 阅读全文

摘要：EOJ440 Buying FeedTime Limit: 2000MSMemory Limit: 65536KTotal Submits: 135Accepted: 16DescriptionFarmer John needs to travel to town to pick up K (1 <= K <= 10,000) pounds of feed. Driving a mile with K pounds of feed costs FJ K*K cents; driving D miles with K pounds of feed in his truck costs 阅读全文

摘要：POJ1944 Fiber CommunicationsTime Limit:1000MSMemory Limit:30000KTotal Submissions:2830Accepted:871DescriptionFarmer John wants to connect his N (1 <= N <= 1,000) barns (numbered 1..N) with a new fiber-optic network. However, the barns are located in a circle around the edge of a large pond, so 阅读全文

摘要：POJ1694 An Old Stone GameTime Limit:1000MSMemory Limit:10000KTotal Submissions:2579Accepted:1137DescriptionThere is an old stone game, played on an arbitrary general tree T. The goal is to put one stone on the root of T observing the following rules:At the beginning of the game, the player picks K s 阅读全文

摘要：POJ1192最优连通子集Time Limit:1000MSMemory Limit:10000KTotal Submissions:1620Accepted:835Description众所周知，我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示，如果x, y都是整数，我们就把点P称为整点，否则点P称为非整点。我们把平面上所有整点构成的集合记为W。定义1 两个整点P1(x1, y1), P2(x2, y2)，若|x1-x2| + |y1-y2| = 1，则称P1, P2相邻，记作P1~P2，否则称P1, P2不相邻。定义 2 设点集S是W的一个有限子集，即S.. 阅读全文

摘要：POJ1770 Special ExperimentTime Limit:1000MSMemory Limit:30000KTotal Submissions:1325Accepted:429DescriptionAs we know, an atom can be in different energy states (or "energy levels"). Usually, when it transits from a higher energy state to a lower one, it will emit a photon, whose energy is 阅读全文

摘要：POJ3659 Cell Phone NetworkTime Limit:1000MSMemory Limit:65536KTotal Submissions:3782Accepted:1305DescriptionFarmer John has decided to give each of his cows a cell phone in hopes to encourage their social interaction. This, however, requires him to set up cell phone towers on hisN(1 ≤N≤ 10,000) past 阅读全文

摘要：POJ3513Let's Go to the MoviesTime Limit:1000MSMemory Limit:65536KTotal Submissions:1736Accepted:429DescriptionA favorite pastime for big families in Acmestan is going to the movies. It is quite common to see a number of these multi-generation families going together to watch a movie. Movie theat 阅读全文

摘要：POJ1155 TELETime Limit:1000MSMemory Limit:65536KTotal Submissions:1872Accepted:865DescriptionA TV-network plans to broadcast an important football match. Their network of transmitters and users can be represented as a tree. The root of the tree is a transmitter that emits the football match, the lea 阅读全文

摘要：POJ1935 JourneyTime Limit:1000MSMemory Limit:30000KTotal Submissions:1239Accepted:445DescriptionThere are n cities in Byteland (numbered from 1 to n), connected by bidirectional roads. The king of Byteland is not very generous, so there are only n-1 roads, but they connect the cities in such a way t 阅读全文

摘要：HDU4008 Parent and sonTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1035Accepted Submission(s): 249Problem DescriptionGive you a tree with N vertices and N‐ 1 edges, and then ask you Q queries on “which vertex is Y's son that has the smallest 阅读全文

摘要：HDU4003 Find Metal MineralTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 759 Accepted Submission(s): 298Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each.. 阅读全文

摘要：HDU4001 To Miss Our Children TimeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1879 Accepted Submission(s): 514Problem DescriptionDo you remember our children time? When we are children, we are interesting in almost everything around ourselves.. 阅读全文

摘要：HDU4028The time of a dayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 143 Accepted Submission(s): 35Problem DescriptionThere are no days and nights on byte island, so the residents here can hardly determine the length of a single day. Fortunat.. 阅读全文