[UVA][最小表示法、窮舉] 12494 - Distinct Substring
BGC TRUST IUPC 2012
Problem A
Distinct Substring
Given a string S, Dexter wants to find the number of
different substrings in S. He considers two substrings same if they have a
cyclic permutation which is same.
If is a...
