[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

maths/gcd.py

@@ -1,21 +1,21 @@
 def gcd(a: int, b: int) -> int:
     """
-    Compute the Greatest Common Divisor (GCD) of two integers using
-    the Euclidean algorithm.
+        Compute the Greatest Common Divisor (GCD) of two integers using
+        the Euclidean algorithm.
 
-    The GCD is the largest positive integer that divides both numbers
-    without leaving a remainder.
+        The GCD is the largest positive integer that divides both numbers
+        without leaving a remainder.
 
-    >>> gcd(48, 18)
+        >>> gcd(48, 18)
+        6
+        >>> gcd(7, 5)
+        1
+        >>> gcd(48, 18)
     6
     >>> gcd(7, 5)
     1
-    >>> gcd(48, 18)
-6
->>> gcd(7, 5)
-1
 
-    :param a: first integer
-    :param b: second integer
-    :return: greatest common divisor of a and b
+        :param a: first integer
+        :param b: second integer
+        :return: greatest common divisor of a and b
     """