Fatedayt

摘要：POJ2115 C LooooopsTime Limit:1000MSMemory Limit:65536KTotal Submissions:11146Accepted:2622DescriptionA Compiler Mystery: We are given a C-language style for loop of typefor (variable = A; variable != B; variable += C) statement;I.e., a loop which starts by setting variable to value A and while vari. 阅读全文

摘要：FZU1607 Greedy divisionAccept: 317Submit: 1248Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionOaiei has inherited a large sum of wealth recently; this treasure has n pieces of golden coins. Unfortunately, oaiei can not own this wealth alone, and he must divide this wealth into m parts 阅读全文

摘要：POJ1659 Frogs' NeighborhoodTime Limit:5000MSMemory Limit:10000KTotal Submissions:3994Accepted:1716Special JudgeDescription未名湖附近共有N个大小湖泊L1,L2, ...,Ln(其中包括未名湖)，每个湖泊Li里住着一只青蛙Fi(1 ≤i≤N)。如果湖泊Li和Lj之间有水路相连，则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1,x2, ...,xn，请你给出每两个湖泊之间的相连关系。Input第一行是测试数据的组数T(0 ≤T≤ 20)。每组数据包括两行，第一 阅读全文

摘要：POJ2135 Farm TourTime Limit:1000MSMemory Limit:65536KTotal Submissions:6299Accepted:2248DescriptionWhen FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which c 阅读全文

摘要：POJ3422 Kaka's Matrix TravelsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4905Accepted:1910DescriptionOn anN×Nchessboard with a non-negative number in each grid, Kaka starts his matrix travels withSUM= 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bo 阅读全文

摘要：POJ2175 Evacuation PlanTime Limit:1000MSMemory Limit:65536KTotal Submissions:1957Accepted:505Special JudgeDescriptionThe City has a number of municipal buildings and a number of fallout shelters that were build specially to hide municipal workers in case of a nuclear war. Each fallout shelter has a 阅读全文

摘要：POJ3436 ACM Computer FactoryTime Limit:1000MSMemory Limit:65536KTotal Submissions:3345Accepted:1112Special JudgeDescriptionAs you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at 阅读全文

摘要：POJ3686 The Windy'sTime Limit:5000MSMemory Limit:65536KTotal Submissions:2536Accepted:1084DescriptionThe Windy's is a world famous toy factory that ownsMtop-class workshop to make toys. This year the manager receivesNorders for toys. The manager knows that every order will take different amo 阅读全文

摘要：POJ2516 Minimum CostTime Limit:4000MSMemory Limit:65536KTotal Submissions:9392Accepted:3108DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M supply places 阅读全文

摘要：EscapeTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 620Accepted Submission(s): 136Problem DescriptionLoneknight hates attending class very much. Every time he is attending class, when he feel tiresome with the class, he start planning the shortes 阅读全文

摘要：HDU1533 Going HomeTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1116Accepted Submission(s): 565Problem DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, 阅读全文

摘要：POJ1904 King's QuestTime Limit:15000MSMemory Limit:65536KTotal Submissions:4537Accepted:1533Case Time Limit:2000MSDescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which of those girls he did 阅读全文

摘要：POJ1486 Sorting SlidesTime Limit:1000MSMemory Limit:10000KTotal Submissions:2246Accepted:822DescriptionProfessor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk, he has t 阅读全文

摘要：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 阅读全文

摘要：POJ1990MooFestTime Limit:1000MSMemory Limit:30000KTotal Submissions:3400Accepted:1330DescriptionEvery year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, 阅读全文