python余数定理mul_inv
余数定理【代码实现】chinese_remainderfind_invpowmul_inv
chinese_remainder
def chinese_remainder(n, a):
sum = 0
prod = reduce(lambda a, b: a*b, n)
for n_i, a_i in zip(n, a):
p = prod / n_i
sum += a_i * mul_inv(p, n_i) * p
return sum
原创
2021-01-28 10:53:41 ·
388 阅读 ·
0 评论