mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 05:39:30 +00:00
bc8df6de31
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.2.2 → v0.3.2](https://github.com/astral-sh/ruff-pre-commit/compare/v0.2.2...v0.3.2) - [github.com/pre-commit/mirrors-mypy: v1.8.0 → v1.9.0](https://github.com/pre-commit/mirrors-mypy/compare/v1.8.0...v1.9.0) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
46 lines
861 B
Python
46 lines
861 B
Python
"""
|
|
Modular Exponential.
|
|
Modular exponentiation is a type of exponentiation performed over a modulus.
|
|
For more explanation, please check
|
|
https://en.wikipedia.org/wiki/Modular_exponentiation
|
|
"""
|
|
|
|
"""Calculate Modular Exponential."""
|
|
|
|
|
|
def modular_exponential(base: int, power: int, mod: int):
|
|
"""
|
|
>>> modular_exponential(5, 0, 10)
|
|
1
|
|
>>> modular_exponential(2, 8, 7)
|
|
4
|
|
>>> modular_exponential(3, -2, 9)
|
|
-1
|
|
"""
|
|
|
|
if power < 0:
|
|
return -1
|
|
base %= mod
|
|
result = 1
|
|
|
|
while power > 0:
|
|
if power & 1:
|
|
result = (result * base) % mod
|
|
power = power >> 1
|
|
base = (base * base) % mod
|
|
|
|
return result
|
|
|
|
|
|
def main():
|
|
"""Call Modular Exponential Function."""
|
|
print(modular_exponential(3, 200, 13))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
import doctest
|
|
|
|
doctest.testmod()
|
|
|
|
main()
|