超级大数乘法（模拟）

超级大数乘法（模拟）

why：因为C和C++对数据有整数有大小要求，所以我们无法直接得到一个超级大数和超级大数的乘法（几十百上千上万位的两个数相乘），所以我们模拟乘法来实现它
具体直接看代码

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> add(vector<int> A,vector<int> B)
{
	if (A.size()<B.size()) return add(B,A);
	vector<int> C;
	int t=0;
	for (int i=0;i<A.size();i++)
	{
		t+=A[i];
		if (i<B.size()) t+=B[i];
		C.push_back(t%10);
		t/=10;
	}
	if (t) C.push_back(t);
	while (C.size()>1&&C.back()==0) C.pop_back();
	reverse(C.begin(),C.end());
	return C;
}

int main()
{
	string s1,s2; cin>>s1>>s2;
	vector<int> a,b,c;
	for (int i=s1.size()-1;i>=0;i--) a.push_back(s1[i]-'0');
	for (int i=s2.size()-1;i>=0;i--) b.push_back(s2[i]-'0');
	reverse(a.begin(),a.end());
	for (int i=a.size()-1;i>0&&a[i]==0;i--) c.push_back(0),a.pop_back();
	reverse(a.begin(),a.end());
	reverse(b.begin(),b.end());
	for (int i=b.size()-1;i>0&&b[i]==0;i--) c.push_back(0),b.pop_back();
	reverse(b.begin(),b.end());
	vector<int> b2=b;
	vector<int> tmp;
	do
	{
		if (b2.empty()) break;
		vector<int> e;
		int t=0;
		int b1;
		b1=b2.front();
		for (int i=0;i<a.size();i++)
		{
			t+=a[i]*b1;
			e.push_back(t%10);
			t/=10;
		}
		if (t) e.push_back(t);
		reverse(tmp.begin(),tmp.end());
		tmp=add(tmp,e);
		c.push_back(tmp.back());
		tmp.pop_back();
		reverse(b2.begin(),b2.end());
		b2.pop_back();
		reverse(b2.begin(),b2.end());
	} while (1);
	for (int i=tmp.size()-1;i>=0;i--) c.push_back(tmp[i]);
	reverse(c.begin(),c.end());
	if (c[0]==0) c.clear(),c.push_back(0);
	for (int i=0;i<c.size();i++) cout<<c[i];
	return 0;
}