11
社区成员




#大数乘法——分块原理
#十进制数的进位问题
def bigmul(x,y,r):
base=10000
x2=int(x/base)
x1=x%base
y2=int(y/base)
y1=y%base
n1=x1y1
n2=x1y2
n3=x2y1
n4=x2y2
r[3]=n1%base
r[2]=int(n1/base)+n2%base+n3%base
r[1]=int(n2/base)+int(n3/base)+n4%base
r[0]=int(n4/base)
r[1]+=int(r[2]/base)
r[2]=r[2]%base
r[0]+=int(r[1]/base)
r[1]=r[1]%base
x=[0,0,0,0]
bigmul(87654321,12345678,x)
print(x[0])
print(x[1])
print(x[2])
print(x[3])