python文本解析_python文本分析

For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. For example, the similarity of strings "abc" and "abd" is 2, while the similarity of strings "aaa" and "aaab" is 3.

Calculate the sum of similarities of a string S with each of it's suffixes.

Input Format

The first line contains the number of test cases T. Each of the next T lines contains a string each.

Constraints

1 <= T <= 10

The length of each string is at most 100000 and contains only lower case characters.

Output Format

Output T lines containing the answer for the corresponding test case.

Sample Input

2

ababaa

aa

Sample Output

11

3

Explanation

For the first case, the suffixes of the string are "ababaa", "babaa", "abaa", "baa", "aa" and "a". The similarities of these strings with the string "ababaa" are 6,0,3,0,1, & 1 respectively. Thus, the answer is 6 + 0 + 3 + 0 + 1 + 1 = 11.

For the second case, the answer is 2 + 1 = 3.

问题如上：

如果是简单的形式来获取the sum of similarities并不是太复杂，但是当这个词巨长的时候问题就产生了，看了下测试数据直接上94773个t，总数溢出，程序完蛋

待解决的问题。。。。。。。。。。。。。。。。。。。。。。。。。。。。