Fatedayt

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

摘要： POJ2635 The Embarrassed CryptographerTime Limit:2000MSMemory Limit:65536KTotal Submissions:8683Accepted:2231DescriptionThe young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptograp 阅读全文

摘要： POJ3252 Round NumbersTime Limit:2000MSMemory Limit:65536KTotal Submissions:4877Accepted:1664DescriptionThe cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host of other 阅读全文

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