摘要：容易：1018, 1050, 1083, 1088, 1125, 1143, 1157, 1163, 1178, 1179, 1189, 1208, 1276, 1322, 1414, 1456, 1458, 1609, 1644, 1664, 1690, 1699, 1740, 1742, 1887, 1926, 1936, 1952, 1953, 1958, 1959, 1962, 1975, 1989, 2018, 2029, , 2063, 2081, 2082, 2181, 2184, 2192, 2231, 2279, 2329, 2336, 2346, 2353, 2355, 2 阅读全文

摘要：Instant ComplexityTime Limit:1000MSMemory Limit:10000KTotal Submissions:941Accepted:325DescriptionAnalyzing the run-time complexity of algorithms is an important tool for designing efficient programs that solve a problem. An algorithm that runs in linear time is usually much faster than an algorithm 阅读全文

摘要：Lucky and Good Months by Gregorian CalendarTime Limit:1000MSMemory Limit:65536KTotal Submissions:887Accepted:258DescriptionHave you ever wondered why normally an year has 365 days, not 400 days? Why August have 31 days, but February have only 28 days? Why there are 7 days, not 6 days, in a week? Do 阅读全文

摘要：Organize Your Train part IITime Limit:1000MSMemory Limit:65536KTotal Submissions:4868Accepted:1422DescriptionRJ Freight, a Japanese railroad company for freight operations has recently constructed exchange lines at Hazawa, Yokohama. The layout of the lines is shown in Figure 1.Figure 1: Layout of th 阅读全文

摘要：Surprising StringsTime Limit:1000MSMemory Limit:65536KTotal Submissions:3457Accepted:2323DescriptionTheD-pairsof a string of letters are the ordered pairs of letters that are distance D from each other. A string isD-uniqueif all of its D-pairs are different. A string issurprisingif it is D-unique fo 阅读全文

摘要：PalindromeTime Limit:3000MSMemory Limit:65536KTotal Submissions:36646Accepted:12380DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal number of 阅读全文

摘要：Human Gene FunctionsTime Limit:1000MSMemory Limit:10000KTotal Submissions:11405Accepted:6296DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have been interested in iden 阅读全文

摘要：The TriangleTime Limit:1000MSMemory Limit:10000KTotal Submissions:24947Accepted:14498Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Eac 阅读全文

摘要：Cow BowlingTime Limit:1000MSMemory Limit:65536KTotal Submissions:8553Accepted:5607DescriptionThe cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this: 7 3 8 8 1 0 2 7 4 4 4 5 阅读全文

摘要：Longest Ordered SubsequenceTime Limit:2000MSMemory Limit:65536KTotal Submissions:18511Accepted:7963DescriptionA numeric sequence ofaiis ordered ifa1<a2< ... <aN. Let the subsequence of the given numeric sequence (a1,a2, ...,aN) be any sequence (ai1,ai2, ...,aiK), where 1 <=i1<i2< . 阅读全文

摘要：PearlsTime Limit:1000MSMemory Limit:10000KTotal Submissions:4381Accepted:2101DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the royal family of Pearlania. But i 阅读全文

摘要：AlignmentTime Limit:1000MSMemory Limit:30000KTotal Submissions:6334Accepted:1995DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers are 阅读全文

摘要：The Cow LexiconTime Limit:2000MSMemory Limit:65536KTotal Submissions:4716Accepted:2144DescriptionFew know that the cows have their own dictionary withW(1 ≤W≤ 600) words, each containing no more 25 of the characters 'a'..'z'. Their cowmunication system, based on mooing, is not very ac 阅读全文

摘要：Cash MachineTime Limit:1000MSMemory Limit:10000KTotal Submissions:15684Accepted:5369DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, 阅读全文

摘要：BalanceTime Limit:1000MSMemory Limit:30000KTotal Submissions:5009Accepted:2969DescriptionGigel has a strange "balance" and he wants to poise it. Actually, the device is different from any other ordinary balance.It orders two arms of negligible weight and each arm's length is 15. Some h 阅读全文

摘要：Channel AllocationTime Limit:1000MSMemory Limit:10000KTotal Submissions:7837Accepted:3980DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repeater must be 阅读全文

摘要：SudokuTime Limit:2000MSMemory Limit:65536KTotal Submissions:8339Accepted:4066Special JudgeDescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The oth 阅读全文

摘要：Shredding CompanyTime Limit:1000MSMemory Limit:10000KTotal Submissions:2260Accepted:1303DescriptionYou have just been put in charge of developing a new shredder for the Shredding Company Although a "normal" shredder would just shred sheets of paper into little pieces so that the contents w 阅读全文

摘要：Network SaboteurTime Limit:2000MSMemory Limit:65536KTotal Submissions:5766Accepted:2449DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traf 阅读全文

摘要：PotsTime Limit:1000MSMemory Limit:65536KTotal Submissions:5062Accepted:2156Special JudgeDescriptionYou are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 ≤i≤ 2) from the tap;DROP(i) empty the potito the drain;POUR(i,j) 阅读全文