摘要：
SoundexTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8097Accepted: 3990DescriptionSoundex coding groups together words that appear to sound alike based on their spelling. For example, "can" and "khawn", "con" and "gone" would be equivalent under Sou 阅读全文
摘要：
Superlong sumsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20143Accepted: 5835DescriptionThe creators of a new programming language D++ have found out that whatever limit for SuperLongInt type they make, sometimes programmers need to operate even larger numbers. A limit of 1000 digits is 阅读全文
摘要：
Simple game on a gridTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 847Accepted: 435DescriptionThere is an infinite grid and an m*n rectangle of stones on it (1 <= m,n <= 1000). The stones are located in the knots of the grid. A following game for a single player is being played. One 阅读全文
摘要：
Simple calculationsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5803Accepted: 2947DescriptionThere is a sequence of n+2 elements a0, a1, ..., an+1 (n<=3000, -1000<=ai<=1000). It is known that ai = (ai-1+ai+1)/2-ci for each i=1, 2, ..., n. You are given a0, an+1, c1, ... , cn. Wr 阅读全文
摘要：
Max SequenceTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 12213Accepted: 5075DescriptionGive you N integers a1, a2 ... aN (|ai| <=1000, 1 <= i <= N). You should output S.InputThe input will consist of several test cases. For each test case, one integer N (2 <= N <= 100000) 阅读全文
摘要：
StepsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 6566Accepted: 3006DescriptionOne steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the previous step. What is the mini 阅读全文
摘要：
Set DefinitionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8210Accepted: 3740DescriptionSet S is defined as follows: (1) 1 is in S; (2) If x is in S, then 2x + 1 and 3x + 1 are also in S; (3) No other element belongs to S. Find the N-th element of set S, if we sort the elements in S by i 阅读全文
摘要：
Series DeterminationTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 5505Accepted: 3601DescriptionBoudreaux and Thibodeaux aren't very good at math, so they need you to write a program that can determine the second degree polynomial used to generate a given sequence of three integers. As 阅读全文
摘要：
Keep on Truckin'Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7096Accepted: 5316DescriptionBoudreaux and Thibodeaux are on the road again . . . "Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!" "Don't worry, Thibodeaux, I already checke 阅读全文
摘要：
Blurred VisionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1410Accepted: 1022DescriptionAliasing is the stair-step effect achieved when attempting to represent a smooth curve using a finite number of discrete pixels. Of course, all computer displays consist of a finite number of pixels, 阅读全文
摘要：
Hard to Believe, but True!Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 3151Accepted: 1784DescriptionThe fight goes on, whether to store numbers starting with their most significant digit or their least significant digit. Sometimes this is also called the "Endian War". The battl 阅读全文
摘要：
Jolly JumpersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 13224Accepted: 4087DescriptionA sequence of n > 0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 1 through n-1. For instance, 1 4 2 3 is a jolly jum 阅读全文
摘要：
Primary ArithmeticTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8356Accepted: 3122DescriptionChildren are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in which a 1 is carried from one digit position to be added to th 阅读全文
摘要：
Drink, on IceTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1283Accepted: 777DescriptionA good drink is always served on ice. That said, the amount of ice is what makes the difference. If it is too much, the drink will be well cooled, however, this is a bit of fraud as there could be less 阅读全文
摘要：
Largest Rectangle in a HistogramTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 10329Accepted: 3267DescriptionA histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure 阅读全文