蓝桥杯大数乘法_其实是看图说话

题目已经将答案给出来了,我们只需要看图说话即可！！！

#include <bits/stdc++.h>
using namespace std;
 
void bigmul(int x, int y, int r[])
{
    int base = 10000;
    int x2 = x / base;
    int x1 = x % base;
    int y2 = y / base;
    int y1 = y % base;
 
    int n1 = x1 * y1;
    int n2 = x1 * y2;
    int n3 = x2 * y1;
    int n4 = x2 * y2;
 
    r[3] = n1 % base;
    r[2] = n1 / base + n2 % base + n3 % base;
    r[1] = __________________;
    r[0] = n4 / base;
 
    r[1] += r[2] / base;
    r[2] = r[2] % base;
    r[0] += r[1] / base;
    r[1] = r[1] % base;
}
 
int main(int argc, char *argv[])
{
    int x[] = {0, 0, 0, 0};
 
    bigmul(87654321, 12345678, x);
 
    printf("%d%d%d%d\n", x[0], x[1], x[2], x[3]);
 
    return 0;
}

由图可知,r[1]应该是对n2取整,对n3取整,对n4取余  之和
即r[1]= n1 / base + n2 / base + n3 % base;

也可以写成:

#include <bits/stdc++.h>
using namespace std;

int main(int argc, char *argv[])
{
    int r[] = {0, 0, 0, 0};
    int x=87654321,y=12345678;
 		//关键代码开始
 		    int base = 10000;
    int x2 = x / base;
    int x1 = x % base;
    int y2 = y / base;
    int y1 = y % base;
 
    int n1 = x1 * y1;
    int n2 = x1 * y2;
    int n3 = x2 * y1;
    int n4 = x2 * y2;
 
    r[3] = n1 % base;
    r[2] = n1 / base + n2 % base + n3 % base;
    r[1] = n2 /base + n3 / base + n4 % base;
    r[0] = n4 / base;
 
    //==========================================
    /*关于这一段,
		是r2的进位给了r1,
		然后r2只要余数,
		r1的进位给了r0,
		然后r1只要余数
		接下来用一张图P3表示:
	*/
    r[1] += r[2] / base;
    r[2] = r[2] % base;
    r[0] += r[1] / base;
    r[1] = r[1] % base;
    //===========================================
 		//关键代码结束
    printf("%d%d%d%d\n", r[0], r[1], r[2], r[3]);
 
    return 0;
}

图p3: