Tous les défis
Moyen 0 résolus 0 % de réussite

Modular Exponentiation

Compute base to the power exponent, modulo a number, with fast exponentiation.

Ce que vous allez apprendre

  • Raise a number to a huge power in O(log exponent) steps
  • Keep every intermediate value reduced to avoid overflow
  • Handle exponent 0 and modulus 1

Problème

Afficher la traduction

Compute base^exponent mod modulus. The exponent can be as large as 10^18, so multiplying by base that many times is impossible; use exponentiation by squaring instead: look at the exponent's binary digits, square the base at every step, and multiply it into the result when the digit is 1. That takes about 60 steps for any exponent here.

Implement modular_exponentiation(base, exponent, modulus).

Reduce base modulo modulus first and after every multiplication. Since modulus ≤ 10^9, the product of two reduced values is below 10^18 and fits in a signed 64-bit integer.

Input

base: The base.

exponent: The power to raise the base to.

modulus: The number to take the remainder by.

Output

Return base^exponent mod modulus, a value from 0 to modulus − 1. Treat base^0 as 1 for every base, including 0, so the answer for exponent 0 is 1 mod modulus.

Contraintes

0 ≤ base ≤ 10^18

0 ≤ exponent ≤ 10^18

1 ≤ modulus ≤ 10^9

Exemples

Exemple 1
Entrée :
base = 3
exponent = 13
modulus = 50

Sortie attendue :
expected = 23
Entrée :
long long base = 3;
long long exponent = 13;
long long modulus = 50;

Sortie attendue :
long long expected = 23;
Entrée :
long base = 3;
long exponent = 13;
long modulus = 50;

Sortie attendue :
long expected = 23;

Explication

3^13 = 1,594,323, and 1,594,323 = 50 × 31,886 + 23, so the answer is 23.

Exemple 2
Entrée :
base = 2
exponent = 10
modulus = 1000

Sortie attendue :
expected = 24
Entrée :
long long base = 2;
long long exponent = 10;
long long modulus = 1000;

Sortie attendue :
long long expected = 24;
Entrée :
long base = 2;
long exponent = 10;
long modulus = 1000;

Sortie attendue :
long expected = 24;

Explication

2^10 = 1024, and 1024 mod 1000 = 24.

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

Look at the exponent one binary digit at a time, starting from the lowest.

Indice 2

Square the base at every step and multiply it into the result when the current bit is 1.

Indice 3

Start the result at 1 % modulus, so modulus 1 gives 0.

Complexité attendue

O(log exponent) time, O(1) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.