|
|
#定义计算最小公倍数的函数
def lcm(a1, a2):
# 获取最大的数
if a1 > a2:
greater = a1
else:
greater = a2
while (True):
if ((greater % a1 == 0) and (greater % a2 == 0)):
lcm = greater
break
greater += 1
return lcm
print("""<a1> x + <b1> y = <c1>
<a2> x + <b2> y = <c2>""")
#打印二元一次方程组的基本式
a1=int(input("<a1>="))
b1=int(input("<b1>="))
c1=int(input("<c1>="))
#输入<a1><b1><c1>的值
print(" ")
a2=int(input("<a2>="))
b2=int(input("<b2>="))
c2=int(input("<c2>="))
#输入<a2><b2><c2>的值
#开始计算
y=int((c1*lcm (a1,a2) - c2*lcm (a1,a2)) / (b1*lcm (a1,a2) - b2*lcm (a1,a2)))
x=int((c1 - b1*y) / a1)
#计算x与y的值
print(x)
print(y)
#打印x和y的值
|
|
