i say that NOT Contains a Specific pattern with length K so i couldn't
Use KMP .
but tnx for Ur reply ;) .
On 8/8/07, narvi [EMAIL PROTECTED] wrote:
Hi,
On Aug 7, 11:52 pm, mohamad momenian [EMAIL PROTECTED] wrote:
Hi
this is the problem :
Is this some assignment for the group
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 isa string with length k and k and N .
thanks and Good luck ;)
--~--~-~--~~~---~--~~
You received this
Dear All
i want to solve the minimum weighted vertex-cover problem , Now during
write that code i want a sample code for maximum matching problem please
help me by sending that sample code to me .
thanks every one.
--~--~-~--~~~---~--~~
You received this message
Hi
i want to construct a priority search tree but i don't know the algorithm
for construct and implement it can anyone help me please?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups Algorithm
Geeks group.
To post
Hi
can any one help me to find this ebook free ( please help me ) thank you :
Horowitz, Sahni, Mehta: Fundamentals of Data Structures in C++
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
No they can't over lap
thank you for your attention
On 11/7/06, shisheng li [EMAIL PROTECTED] wrote:
Can the 4 overlap?
From:
algogeeks@googlegroups.com [mailto:
algogeeks@googlegroups.com] On Behalf Of mohamad momenianSent: Tuesday, November 07, 2006 4:09 PM
To:
and output.
On 11/7/06, mohamad momenian
[EMAIL PROTECTED] wrote:
Hi
i have a problem please help me
The input of problem is : width and height of 4 rectangle that is between 1,50
and thewe mustcalculate widthand height ofallof rectangles that can coverthis 4 rectangles and it'sareabecome
