码农小站

摘要： Gold Balanced LineupTime Limit:2000MSMemory Limit:65536KTotal Submissions:10516Accepted:3145DescriptionFarmer John'sNcows (1 ≤N≤ 100,000) share many similarities. In fact, FJ has been able to narrow down the list of features shared by his cows to a list of onlyKdifferent features (1 ≤K≤ 30). For 阅读全文

摘要： To the MaxTime Limit:1000MSMemory Limit:10000KTotal Submissions:36422Accepted:19130DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all t 阅读全文

摘要： TrianglesAccept:12 Submit:28 Time Limit:1000MS Memory Limit:65536KBDescriptionThere are points given in a space. There are no three points, such that they lie on the same straight line. Each pair of points is connected by a segment coloured red or black. Each triangle, whose sides have the same colo 阅读全文

摘要： Job Scheduling Accept:13 Submit:24 Time Limit:1000MS Memory Limit:65536KB Job SchedulingDescriptionWe are given independent and indivisible jobs numbered from 1 to N . They should be executed sequentially in any order. The later the execution of a job starts the longer it lasts - precisely, the t... 阅读全文

摘要： RectangleAccept:11Submit:14Time Limit:1000MSMemory Limit:65536KBRectangleDescriptionGiven three vertices of a rectangle on a 2D plane, you're required to determine the coordinate of the fourth vertex.Input FormatAn integer T(T≤100) will exist in the first line of input, indicating the number of 阅读全文

摘要： WinnerAccept:8Submit:15Time Limit:1000MSMemory Limit:65536KBWinnerDescriptionAlice and Bob likes playing games. In each round, the one who wins will get one point. When one of them makes his/her points reach 11 firstly, we say he/she has won a set of game, and they will start the next set. However, 阅读全文

摘要： Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:24844Accepted:7457DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify whi 阅读全文

摘要： Spell checkerTime Limit:2000MSMemory Limit:65536KTotal Submissions:16225Accepted:5938DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their for 阅读全文

摘要： Round and Round We GoTime Limit:1000MSMemory Limit:10000KTotal Submissions:11201Accepted:5181DescriptionA cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a"cycle"of the digits of the original number. That is, if you consider the numb 阅读全文

摘要： Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:32626Accepted:11642DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in 阅读全文

摘要： Fence RepairTime Limit:2000MSMemory Limit:65536KTotal Submissions:18686Accepted:5948DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN(1 ≤N≤ 20,000) planks of wood, each having some integer lengthLi(1 ≤Li≤ 50,000) uni 阅读全文

摘要： Who's in the MiddleTime Limit:1000MSMemory Limit:65536KTotal Submissions:26878Accepted:15526DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much o 阅读全文

摘要： HighwaysTime Limit:1000MSMemory Limit:65536KTotal Submissions:18115Accepted:8420DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning 阅读全文

摘要： Goldbach's ConjectureTime Limit:1000MSMemory Limit:65536KTotal Submissions:33082Accepted:12691DescriptionIn 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Every even number greater than 4 can be written as the s 阅读全文

摘要： WatchcowTime Limit:3000MSMemory Limit:65536KTotal Submissions:5178Accepted:2171Special JudgeDescriptionBessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes h 阅读全文

摘要： The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:17669Accepted:8547DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separa 阅读全文

摘要： When Can We Meet?Time Limit:1000MSMemory Limit:30000KTotal Submissions:4405Accepted:2412DescriptionThe ICPC committee would like to have its meeting as soon as possible to address every little issue of the next contest. However, members of the committee are so busy maniacally developing (possibly us 阅读全文

摘要： BabelfishTime Limit:3000MSMemory Limit:65536KTotal Submissions:27391Accepted:11827DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.InputInput consists of 阅读全文

摘要： 食物链Time Limit:1000MSMemory Limit:10000KTotal Submissions:34498Accepted:10026Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述： 第一种说法是"1 X Y"，表示X和Y是同类。 第二种说法是"2 X Y"，表示X吃Y。 此人对N个动物，用上述两种说法，一句接一句地说出K 阅读全文

摘要： 根据关键字进行字符串拷贝Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4633Accepted: 1021Description把源字符串拷贝到目的字符串，如果指定关键字，则以该关键字结束(不包括关键字本身)，如果拷贝失败，则得到空串。 具体要求：实现如下函数原型SafeStrcpy2KeyWord()，并在代码中调用该函数实现上述功能。该函数的实现要考虑各种可能的参数取值，以确保程序不出现崩溃。 int SafeStrcpy2KeyWord(char* pDestBuffer, //拷贝的目的地地址 cha... 阅读全文