Re: Count all the substrings in a string

shailendra.malik@xxxxxxxxx wrote:
> Hi,
>
> Though I am replying very late, but I just came across yr thread today
> only. The problem that you had reported are known as the combinations
> for a string "abcd", which is
>
> 1+ ∑ n!/(n-i)!*i! (where i = 1 to n)

This is off topic, but how did you get a sigma in ascii characters?

Thanks in advance,
NG
--
"The life of a repoman is always intense."
.

Relevant Pages

  • Python Graph API
    ... Has there been any work done lately on the Python Graph API? ... "The life of a repoman is always intense." ... Prev by Date: ...
    (comp.lang.python)
  • Re: Hottest actress in current movies or TV?
    ... Rose McGowan, charmed. ... "The life of a repoman is always intense." ... Prev by Date: ...
    (rec.arts.sf.movies)
  • Re: Patching Help
    ... >> Where can I find the hitpoint color patch? ... "The life of a repoman is always intense." ... Prev by Date: ...
    (rec.games.roguelike.nethack)
  • Re: Is this book any good?
    ... > But I read it as an interested outsider; ... "The life of a repoman is always intense." ... Prev by Date: ...
    (sci.logic)
  • Re: entropy H(X+Y)
    ... > X and Y are random variables defined in the same set, ... "The life of a repoman is always intense." ... Prev by Date: ...
    (comp.theory)