@ above m nt getting binary search and fast exponentiation .. please elaborate.
On Fri, Jan 21, 2011 at 2:07 PM, juver++ <[email protected]> wrote: > The most well done solution is to store possible powers of 3 in a table > (this table will be small), and then try to find number M. > > -- > 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]<algogeeks%[email protected]> > . > 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 [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.
