yeah you are right im talking abt that quesn only
i got the power part but how could i store that F(n)(the gcd) part
which is supposedly very large..?
On Fri, May 4, 2012 at 3:28 AM, shiv narayan wrote:
> it looks you are talking about unlock 1 or 2 on spoj, use your own
> recursive power fu
it looks you are talking about unlock 1 or 2 on spoj, use your own
recursive power function and since result may be very large so at
every stage take mod.
pow(a,b)
{
if(b==1)
return a;
else
{
if(b%2==0)
return (pow(a,b/2)%mod *pow(a,b/2)%mod) %mod
else
return pow(a,b/2)%mod *pow(a,b/2)%mod) %
