modular exponentiation

Elegant Eland answered on August 23, 2021 Popularity 10/10 Helpfulness 2/10

answer modular exponentiation

modular exponentiation

Comment

long long int PowMod(long long int x,long long int n,long long int M)
		{
		    if(n<=1)
		        return x%M;
		   long long int res;
		    res=PowMod(x,n/2,M)%M;
		    res=(res*res)%M;
		    if(n%2==1)
		        res=((res%M)*(x%M))%M;
		    return res%M;
		}

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: exponentiation modular whatever

Link to this answer
Share Copy Link

Contributed on Aug 23 2021

Elegant Eland

0 Answers Avg Quality 2/10

modular exponentiation

Contents

More Related Answers

modular exponentiation

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.