摘要：A string is finite sequence of characters over a non empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called fa 阅读全文

摘要：A string is finite sequence of characters over a non empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called fa 阅读全文

摘要：You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with 阅读全文

摘要：Given a string, we need to find the total number of its distinct substrings. Input T number of test cases. T define ui unsigned int define ll long lon 阅读全文