Thank you
On 4 March 2010 19:54, Anil Kishore wrote:
> Refer to the post here:
>
> http://forums.topcoder.com/?module=Thread&threadID=666810&start=0
>
> - AK
>
>
> On Thu, Mar 4, 2010 at 7:40 PM, B |_ /\ C |<--D ! /\ /\/\ O /\| D <
> patidarc...@gmail.com> wrote:
>
>> that last one can be done f
Refer to the post here:
http://forums.topcoder.com/?module=Thread&threadID=666810&start=0
- AK
On Thu, Mar 4, 2010 at 7:40 PM, B |_ /\ C |<--D ! /\ /\/\ O /\| D <
patidarc...@gmail.com> wrote:
> that last one can be done from modular way how to get the first i have read
> the problem on kodeche
that last one can be done from modular way how to get the first i have read
the problem on kodechef.
On Thu, Mar 4, 2010 at 1:59 PM, vivek bijlwan wrote:
> we can use modular exponentiation to start with.
>
> On Tue, Mar 2, 2010 at 9:38 PM, rajesh patidar wrote:
>
>> i wanna to know how to find
modular exponentiation would give the last few digits... (btw this is a
problem from spoj :P)
Anil
On Thu, Mar 4, 2010 at 1:59 PM, vivek bijlwan wrote:
> we can use modular exponentiation to start with.
>
>
> On Tue, Mar 2, 2010 at 9:38 PM, rajesh patidar wrote:
>
>> i wanna to know how to fin
we can use modular exponentiation to start with.
On Tue, Mar 2, 2010 at 9:38 PM, rajesh patidar wrote:
> i wanna to know how to find the kirst k digit of n^n
> n can wary from 0
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post t
i wanna to know how to find the kirst k digit of n^n
n can wary from 0http://groups.google.com/group/algogeeks?hl=en.
