say_c_box的博客

DISUBSTR - Distinct Substringsno tags Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach test case consists of one st

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 51218 Accepted: 21386DescriptionGiven two strings a and b we define a*b to be their conca

REPEATS - Repeatsno tags A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the string s = abaabaabaaba

The repetition number of a string is defined as the maximum number R such that the string can be partitioned into R same consecutive substrings. For example, the repetition number of "ababab" is 3 and

Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 31523 Accepted: 12719Case Time Limit: 1000MSDescriptionThe little cat is major

Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11195 Accepted: 3701DescriptionA substring of a string T is defined as:T(i, k)=

Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 15912 Accepted: 4695DescriptionYou may have wondered why most extraterrestrial life forms

PHRASES - Relevant Phrases of Annihilationno tags You are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned a