[algogeeks] SubStringsCount

[Mohammad Moghimi]

Hi,
given an string of alphabets we want to count number of its distinct substrings. A substring is a continous sequence of the given string.
for example ABAB has 7 substrings which are as follows:
A
B
AB
BA
ABA
BAB
ABAB
the maximum size of string is 1000.
Thanks,

ps: from[bytecode 2k6]

--
-- Mohammad
do you C?!!
double m[] = { 9580842103863.650391, 133470973390.236450, 270};
int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);}
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---