摘要：
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 e 阅读全文
摘要：
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 = aba 阅读全文
摘要：
Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T<=20;Each test case consists of one strin 阅读全文