高精度乘法基本思想和加法一样。其基本流程如下：



①读入被乘数s1，乘数s2

②把s1、s2分成4位一段，转成数值存在数组a,b中；记下a,b的长度k1,k2；

③i赋为b中的最低位；

④从b中取出第i位与a相乘，累加到另一数组c中；（注意：累加时错开的位数应是多少位

？）

⑤i:=i-1；检测i值：小于k2则转⑥,否则转④

⑥打印结果-High-precision multiplication and addition the same basic idea. The basic process is as follows: ① read multiplicand s1, multiplier s2 ② to s1, s2 is divided into four section into the existence of an array of values a, b in　write down a, b the length of k1, k2　③ i given for the b of the lowest　④ Remove from b in the first i-bit and a multiply, accumulate to another array in c　(Note: The median cumulative time should be staggered how many?) ⑤ i: = i-1　detection i value: less than k2 was transferred ⑥, otherwise switch to print the results ④ ⑥