Given a number u have to check whether the number(N) can be expressed in the form 3^n = N i:e It can be expressed in terms of power of 3.
It can be done taking log on both but I am looking an alternate approach (bit manipulation) . -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
