"You can't". You'd need a lot of memory and a lot of time to work out the integer part of this large a value. However, you don't need to work out the entire integer part. You can, for instance find the last two digits of 2301^45392884746345 without working out all of the digits. See the "Contest Analysis" at http://bit.ly/21iXp4 On 18 Apr 2011 17:11, "raulrag" <[email protected]> wrote: > How will u handle such a large input of 2000000000 in C . > What different techniques can be used to find (3+root(5) ) ^N for such > a large input > > -- > You received this message because you are subscribed to the Google Groups "google-codejam" 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/google-code?hl=en. >
-- You received this message because you are subscribed to the Google Groups "google-codejam" 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/google-code?hl=en.
