输入一行包含四个整数,,和.
输出两个整数表示满足条件的和.若不存在,则输出"0 0".
1 1 2 1
0 0
1000 500 4 2
1000 500
1000 500 3 1
999 333
def niuke2(): A, B, a, b = [int(i) for i in input().split()] gcd_ab = gcd(a, b) x_min = a / gcd_ab y_min = b / gcd_ab mul = min(int(A / x_min), int(B / y_min)) return str(int(x_min * mul))+' '+str(int(y_min * mul)) # 求最大公约数 def gcd(mm: int, nn: int) -> int: m = max(mm, nn) n = min(mm, nn) rem = 1 while rem: rem = m % n m = n n = rem return m print(niuke2())