涅槃phy的专栏

ProblemDescription Now you are back,andhave a task to do: Given you a string s consist of lower-case English letters only,denote f(s) asthe number of distinct sub-string of s. And you have some que

ProblemDescription In this problem,you are given several strings that contain only digits from '0' to '9',inclusive. An example is shown below. 101 123 The set S of strings is consists of the N s