简单易懂自定义函数处理最大公约和最小公倍

One:
def gcd(a,b):
   if a%b==0:
       return b
   else:
       return gcd(b,a%b)
def lcm(a,b):
   ss=(a*b)/nums
   return ss
num1,num2=map(int,input().split())
if num1<num2:
   flag=num1
   num1=num2
   num2=flag
nums=gcd(num1,num2)
numss=lcm(num1,num2)
print('{:.0f} {:.0f}'.format(nums,numss))

Two:

def gcd(a,b):

    for i in range(b,0,-1):

        if a%i==0 and b%i==0:

            return i

def lcm(a,b):

    for i in range(nums,a*b+1):

        if i%a==0 and i%b==0:

            return i

num1,num2=map(int,input().split())

nums=gcd(num1,num2)

numss=lcm(num1,num2)

print(nums,numss,end='')