I think it could be 2^n - (n-k+1) * 2^(n-k)) On 8/8/07, mohamad momenian <[EMAIL PROTECTED]> wrote: > > Hi > > this is the problem : > > How many strings with length "N" that contains Only "0" and "1" exist > that not contains a specific pattern with length "K" > input is " a string with length k" and "k" and "N" . > > thanks and Good luck ;) > > > >
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
