@abinesh:
The solution given has a very very high complexity. as it finds all
possiblilities and tests each one of it.
is it *n*[(2n!)/(n! * n!)]* -- This is exponential solution. I am not sure
but, there must be a DP solution to this .
--Sravan Reddy
On Wed, Jul 11, 2012 at 12:15 AM, arumuga
for your example
5 4 3 2 1
5 4 3 2 1 -- candies assignement.
(since the length of the longest decreasing sequence is 4,
and length of increasing seq. before it is 0.
its max(0+1,4)+1 = 5
--Sravan Reddy
On Tue, Jul 10, 2012 at 8:09 AM, bala bharath bagop...@gmail.com wrote:
can u explain ur
Again, the properties of hash function guarentees the preimage resistance,
in the link.
so, if given a hash, its difficult to find a message that has the provided
hash.
Also, yes.. with some probability. 1/(2^256) -- which is very very very
less.
(and can be considered to be 0, looking at the
