say_c_box的博客

DISUBSTR - Distinct Substrings no tags  Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T Each test case consists of one st

Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 51218   Accepted: 21386 Description Given two strings a and b we define a*b to be their conca

REPEATS - Repeats no 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 Message Time Limit: 4000MS   Memory Limit: 131072K Total Submissions: 31523   Accepted: 12719 Case Time Limit: 1000MS Description The little cat is major

Common Substrings Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 11195   Accepted: 3701 Description A substring of a string T is defined as: T(i, k)=

Life Forms Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 15912   Accepted: 4695 Description You may have wondered why most extraterrestrial life forms

PHRASES - Relevant Phrases of Annihilation no 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