Breaking News: Grepper is joining You.com. Read the official announcement!

modular exponentiation algorithm c++

Sleep deprived answered on March 11, 2022 Popularity 7/10 Helpfulness 5/10

answer modular exponentiation algorithm c++

modular exponentiation algorithm c++

Comment

#include <iostream>
using namespace std;

int main()
{
    int b, n, m, x =1, a[10], i, k=0;
    int power;

    // input part
    cout<< "Enter base: ";
    cin>> b;

    cout<< "Enter power raised: ";
    cin>> n;

    cout<< "Enter modular value: ";
    cin>> m;

    power =  b % m;

    // converting value of n to binary
    for(i=0; n>0; i++)
    {
        a[i]=n%2;
        n= n/2;
        k++;
    }

    // getting value of x
    for(i=0; i<k; i++)
    {
        if (a[i] == 1)
        {
            x = (x * power) % m;
            power = (power * power) % m;
        }

        else
            power = (power * power) % m;
    }

    // x is the result of modular expansion (b^n mod m)
    cout<< x;

    return 0;
}

Popularity 7/10 Helpfulness 5/10 Language cpp

Source: Grepper

Tags: algorithm c++ exponentiation modular

Link to this answer
Share Copy Link

Contributed on Mar 11 2022

Sleep deprived

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

modular exponentiation algorithm c++

Contents

More Related Answers

modular exponentiation algorithm c++

Grepper

Documentation

Social

Legal

Contact

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