摘要：
The Separator in GridTime Limit:1000MSMemory Limit:30000KTotal Submissions:2504Accepted:776DescriptionGiven a connected, undirected graph G = (V, E), where V is the vertex set consisting a collection of nodes, and E is the set of edges, each of which connects two nodes from V. A vertex subset S is a 阅读全文
摘要：
Finding NemoTime Limit:2000MSMemory Limit:30000KTotal Submissions:6289Accepted:1426DescriptionNemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and couldn't find his way home. Therefore, he sent a signal to his father, Marlin, to ask for help. 阅读全文
摘要：
UNIMODAL PALINDROMIC DECOMPOSITIONSTime Limit:1000MSMemory Limit:65536KTotal Submissions:4279Accepted:2105DescriptionA sequence of positive integers is Palindromic if it reads the same forward and backward. For example:23 11 15 1 37 37 1 15 11 231 1 2 3 4 7 7 10 7 7 4 3 2 1 1A Palindromic sequence i 阅读全文
摘要：
PalindromeTime Limit:3000MSMemory Limit:65536KTotal Submissions:43460Accepted:14815DescriptionA 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 阅读全文
摘要：
To the MaxTime Limit:1000MSMemory Limit:10000KTotal Submissions:32838Accepted:17175DescriptionGiven 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 阅读全文
摘要：
SticksTime Limit:1000MSMemory Limit:10000KTotal Submissions:100068Accepted:22747DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally an 阅读全文
摘要：
DefragmentTime Limit:2000MSMemory Limit:10000KTotal Submissions:2938Accepted:993Case Time Limit:1000MSSpecial JudgeDescriptionYou are taking part in the development of a "New Generation" operating system and the NG file system. In this file system all disk space is divided into N clusters 阅读全文
摘要：
Power StringsTime Limit:3000MSMemory Limit:65536KTotal Submissions:23530Accepted:9880DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication 阅读全文
摘要：
PeriodTime Limit:3000MSMemory Limit:30000KTotal Submissions:9792Accepted:4477DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i < 阅读全文
摘要：
Three powersTime Limit:1000MSMemory Limit:30000KTotal Submissions:4094Accepted:1833DescriptionConsider the set of all non-negative integer powers of 3.S = { 1, 3, 9, 27, 81, ... }Consider the sequence of all subsets of S ordered by the value of the sum of their elements. The question is simple: find 阅读全文