Euclidean Algorithm for GCD Calculation

Calculates the Greatest Common Divisor (GCD) of two integers using the Euclidean algorithm.

Technology Stack : None

Code Type : Mathematical calculation function

Code Difficulty : Beginner

                
                    
def aaaaa(arg1, arg2):
    """
    计算两个整数的最大公约数。
    """
    while arg2:
        arg1, arg2 = arg2, arg1 % arg2
    return arg1