Run ID:87175

提交时间:2024-08-04 16:00:12

import math def max_gongyueshu(a,b): return math.gcd(a,b) def min_gongbeishu(a,b): c=min(a,b) m=c while m>=c: if m%a==0 and m%b==0: print(m) break m+=c a,b=map(int,input().split()) print(max_gongyueshu(a,b),end=" ") min_gongbeishu(a,b)