@All : pls suggest an algo.............

On Fri, Jul 29, 2011 at 10:21 AM, sukhmeet singh <sukhmeet2...@gmail.com>wrote:

> *http://code.google.com/codejam/contest/dashboard?c=32001*
>
>
> On Fri, Jul 29, 2011 at 10:43 PM, swetha rahul <swetharahu...@gmail.com>wrote:
>
>> Hi,
>>             given a complete binary tree (either a node is a leaf node or
>> has two children)
>>
>> every leaf node has value 0 or 1.
>> every internal node has value as the AND gate or OR gate.
>> you are given with the tree and a value V.
>> you have to output the minimum number of flips (AND to OR or OR to AND) if
>> the evaluated value is not equal to V, if it is equal return 0, if not
>> possible return -1.
>> you can just change the value of internal nodes i.e can make and to or ,
>> or to and to get the desired output
>> give the minimum number of flips required to get the desired output.
>>
>>  --
>> 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
>> algogeeks+unsubscr...@googlegroups.com.
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>
>  --
> 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
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>



-- 
Thank You
Rajeev Kumar

-- 
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 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to