Modular Exponentiation Algorithm in C++

This C++ Program demonstrates the implementation of Modular Exponentiation Algorithm.

Here is source code of the C++ Program to demonstrate the implementation of Modular Exponentiation Algorithm. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/* 
```

 * C++ Program to Implement Modular Exponentiation Algorithm

```
 */
```
```
#include <iostream>
```
```
#define ll long long
```
```
using namespace std; 
```
```
 
```
```
/* 
```

 * Function to calculate modulus of x raised to the power y

```
 */
```

ll modular_pow(ll base, ll exponent, int modulus)

```
{
```
```
    ll result = 1;
```
```
    while (exponent > 0)
```
```
    {
```
```
        if (exponent % 2 == 1)
```

            result = (result * base) % modulus;

```
        exponent = exponent >> 1;
```
```
        base = (base * base) % modulus;
```
```
    }
```
```
    return result;
```
```
}
```
```
/* 
```
```
 * Main
```
```
 */
```
```
int main()
```
```
{
```
```
    ll x, y;
```
```
    int mod;
```
```
    cout<<"Enter Base Value: ";
```
```
    cin>>x;
```
```
    cout<<"Enter Exponent: ";
```
```
    cin>>y;
```
```
    cout<<"Enter Modular Value: ";
```
```
    cin>>mod;
```
```
    cout<<modular_pow(x, y , mod);
```
```
    return 0;
```
```
}
```

$ g++ mod_exponentiation.cpp
$ a.out
 
Enter Base Value: 2
Enter Exponent: 5
Enter Modular Value: 23
9
 
------------------
(program exited with code: 1)
Press return to continue

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

If you wish to look at all C++ Programming examples, go to C++ Programs.

« Prev - C++ Program to Implement Longest Prefix Matching

» Next - C++ Program to Implement Miller Rabin Primality Test

Related Posts:

Recommended Articles: