Created
July 31, 2023 15:29
-
-
Save henriquesebastiao/3f438d7bc6ba1596359b50e47975696b to your computer and use it in GitHub Desktop.
O algoritmo de euclides é uma maneira simples de calcular o MDC (Máximo Divisor Comum) entre dois dois números inteiros diferentes de zero.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def mdc(a: int, b: int) -> int: | |
| if b == 0: | |
| return a | |
| else: | |
| return mdc(b, a % b) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment