count island problem
On Jul 1, 2012, at 11:06 AM, Vikas wrote:
Given matrix(screen black n white)..where 1 represents black dot and 0=white.
there can b many images/objects in it..return list of coordinates for each
obkect..(Hint do BFS)
--
You received this message because you are
Given matrix(screen black n white)..where 1 represents black dot and
0=white.
there can b many images/objects in it..return list of coordinates for each
obkect..(Hint do BFS)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this
I've read this following solution from USACO for IOI98 - Party Lamps
problem..but I don't know why 2^4 and I don't know why the complete
search works for this problem...!!!
I didn't get exactly what it say...
Can anybody help me to understand it?
Thanks...
IOI 98 - Party Lamps:
Write a program to find the index in an circular array such that the
string that is formed starting from that index is first in
lexicographic order.
on all the sites the code part is misunderstood for the test case
ABCDEAABCCDA
--
You received this message because you are subscribed to the
provide a sample i/p output..!!
On Tue, Jul 26, 2011 at 11:43 PM, coder coder
i.code.program...@gmail.comwrote:
Write a program to find the index in an circular array such that the
string that is formed starting from that index is first in
lexicographic order.
on all the sites the code part
I am last year student preparing for placements
can any one give some ebooks on data structure, algo etc. like beofre some
time , some one posted a book how to crack the coding interview that was
an awesome book thanks to the guy who send the book . if anyone has some
good ebooks or links
http://www.spoj.pl/problems/PIGBANK/
can anyone give me an idea how to solve this problem...?? I dont think
the knapsack algo would be of help here as here we need to find
minimum value..please refer to the link and if anyone can help, i
would be very thankful.
regards,
aksha
--
You received
a small modification in normal knapsack algo ll do :)
On Thu, Feb 24, 2011 at 4:06 PM, Akshata Sharma
akshatasharm...@gmail.comwrote:
http://www.spoj.pl/problems/PIGBANK/
can anyone give me an idea how to solve this problem...?? I dont think
the knapsack algo would be of help here as here we
Consider a simple polygon P over vertices, on the plane, and a point
s, which maybe inside or outside P. Design an O(nlogn) algorithm that
finds a line segment starting from, and cutting a maximum number of
edges of P. An edge of P is any one of the line segments making up its
boundary. (Note that
On Wed, Apr 14, 2010 at 1:22 PM, vikrant singh vikrantsing...@gmail.comwrote:
there is a problem to find first K digits of no. N^N , where N can be as
large as 10^9.
so, the algo goes like,
take fractional part(f) of Nlog10(N).
and temp=pow(10,f),
result =(long )10^k * temp.
I want to
Can anyone please solve any of the following problems? I need a
detailed solution. It is my data structure assignment, and i have to
submit it by the 4th of april. Please someone help me... its urgent.
Show that if an edge(u,v)is contained in some MST, then it is a light
edge crossing some cut
11 matches
Mail list logo
