模拟

模拟大数乘法：
例题：https://sdnuoj.rainng.com/problem/show/1232
分析：由乘法竖式得到灵感
代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
const int N = 1e3 + 7;
const int M = 1e6 + 7;

string sa, sb;
int a[N], b[N];
int sum[M];

int main(){
	std::ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	while(cin >> sa >> sb){
		memset(sum, 0, sizeof sum);
		int lena = sa.length();
		int lenb = sb.length();
		int len = lena + lenb;
		for (int i = 0; i < lena; ++i){
			a[lena - i] = sa[i] - '0'; //倒序存入数组，方便相乘 
		}
		for (int i = 0; i < lenb; ++i){
			b[lenb - i] = sb[i] - '0'; 
		}
		for (int i = 1; i <= lena; ++i){
			for (int j = 1; j <= lenb; ++j){
				sum[i + j - 1] += a[i] * b[j];//根据竖式，应该是i+j-1 
			}
		}
		for (int i = 1; i <= len; ++i){
			if(sum[i] >= 10){//进位 
				sum[i + 1] += sum[i] / 10;
				sum[i] = sum[i] % 10;
			}
		}
		while(sum[len] == 0 && len > 1){//倒序输出，防止前面有0 
			len--;
		}
		for (int i = len; i >= 1; --i){//倒序输出 
			cout << sum[i];
		}
		cout << endl;
	}