Question

Написать функцию вычисляющую НОД двух чисел

Answer 1

Ответ:

def gcd(a : int, b : int):

while(a != 0 and b != 0):

if (a > b): a = a % b

else: b = b % a

return a + b

print(gcd(7006652, 112307574))

Answer 2

Function to Calculate the Greatest Common Divisor (GCD) of Two Numbers

To write a function that calculates the Greatest Common Divisor (GCD) of two numbers, you can use the Euclidean algorithm. The Euclidean algorithm is an efficient method for finding the GCD of two numbers.

Here's an example of a function in Python that calculates the GCD of two numbers:

def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

In this function, `a` and `b` are the two numbers for which we want to find the GCD. The algorithm repeatedly divides `a` by `b` and assigns the remainder to `b`. This process continues until `b` becomes zero, at which point the GCD is equal to `a`.

You can use this function to calculate the GCD of any two numbers by calling it with the desired values for `a` and `b`.

For example, to calculate the GCD of 24 and 58, you can use the function like this:

print(gcd(24, 58))

The output will be `2`, which is the GCD of 24 and 58.

Note: The function provided above is a commonly used implementation of the Euclidean algorithm for calculating the GCD. It is a concise and efficient way to find the GCD of two numbers.