DISUBSTR  Distinct Substrings
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 string, whose length is <= 1000
Output
For each test case output one number saying the number of distinct substrings.
Example
Sample Input:
2
CCCCC
ABABA
Sample Output:
5
9
Explanation for the testcase with string ABABA:
len=1 : A,B
len=2 : AB,BA
len=3 : ABA,BAB
len=4 : ABAB,BABA
len=5 : ABABA
Thus, total number of distinct substrings is 9.
Added by:  Prasanna 
Date:  20060113 
Time limit:  0.159s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: NODEJS PERL 6 SCM chicken VB.net 
Resource:  ByteCode '06 
hide comments
mehrunesartem:
20150415 17:07:16
Last edit: 20150415 17:13:32 

L:
20150214 18:46:13
Last edit: 20150310 20:10:01 

the_imp:
20150214 06:17:04
what should be the answer for "AbABa"..... i'm using suffix array and lcs getting wa Last edit: 20150214 06:50:44 

Rajat (1307086):
20150128 12:19:51
Got a new definition of sub string:


Kishlay Raj:
20150125 06:35:44
learnt alot 

gamer496:
20141224 21:18:01
finally after 3 days of understanding suffix array and lcp and numerous wrong answers 

surayans tiwari(http://bit.ly/1EPzcpv):
20141222 11:22:16
used set vector and with just 30 lines of code got it accepted 

numerix:
20141115 06:18:04
Another problem that switched from Pyramid to Cube within the last 12 hours. Time limit seems to be adjusted "automatically", but should be less strict for slower languages.


Varun Gambhir:
20140904 08:12:10
Suffix Array :) 

KevinMercer:
20140814 07:52:38
He's wrong!There're sth far from 'A'~'Z'! 