Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- """
- Алгоритм Евклида, нахождение наибольшего общего делителя
- """
- def gcd(a, b):
- if b == 0: return a
- return gcd(b, a % b)
- print(gcd(30, 12)) # указываем любые 2 целых числа
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement