From c03249f475c266e0e377be546bd1833657737b30 Mon Sep 17 00:00:00 2001
From: stud203799 <stud203799@vyatsu.ru>
Date: Tue, 14 Apr 2026 21:01:33 +0300
Subject: [PATCH] =?UTF-8?q?=D0=B7=D0=B0=D0=B2=D0=B5=D1=80=D1=88=D0=B5?=
 =?UTF-8?q?=D0=BD=D0=B8=D0=B5=20=D0=BF=D1=80=D0=BE=D0=B3=D1=80=D0=B0=D0=BC?=
 =?UTF-8?q?=D0=BC=D1=8B=20=D0=BF=D0=BE=D0=B8=D1=81=D0=BA=20=D0=BD=D0=BE?=
 =?UTF-8?q?=D0=B4'=D0=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 tasks_on_python/N8_grand_common_divider.py | 14 ++++++++++++--
 1 file changed, 12 insertions(+), 2 deletions(-)

diff --git a/tasks_on_python/N8_grand_common_divider.py b/tasks_on_python/N8_grand_common_divider.py
index 160ab49..15adec0 100644
--- a/tasks_on_python/N8_grand_common_divider.py
+++ b/tasks_on_python/N8_grand_common_divider.py
@@ -2,8 +2,18 @@
 # Найти наибольший общий делитель двух чисел (алгоритм Евклида).
 
 def gcd(a: int, b: int):
-    return int
+    if a < b:
+        c = a
+        a = b
+        b = c
+    r = a % b
+    if r != 0:
+        a = b
+        b = r
+        return gcd(a, b)
+    else:
+        return b
 
 
 print("Задайте два числа для поиска наибольшего общего делителя")
-print(gcd())
\ No newline at end of file
+print(gcd(int(input()), int(input())))