摘要： PeriodTime Limit:3000MSMemory Limit:30000KTotal Submissions:10858Accepted:4997DescriptionFor 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 < 阅读全文

摘要： Seek the Name, Seek the FameTime Limit:2000MSMemory Limit:65536KTotal Submissions:9446Accepted:4516DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same ti 阅读全文

摘要： Power StringsTime Limit:3000MSMemory Limit:65536KTotal Submissions:26444Accepted:11072DescriptionGiven 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 multiplicatio 阅读全文

摘要： OulipoTime Limit:1000MSMemory Limit:65536KTotal Submissions:16111Accepted:6482DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter'e'. He was a member of the Oulipo group. A quote from the book:Tout avait Pair normal, mais tout s’affirm 阅读全文

摘要： MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:14330Accepted:5411DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 #include #include using namespace std;#define MAXNUM 1005int .. 阅读全文