高精度算法题解

#include <bits/stdc++.h>
using namespace std;
int a[101], b[101], c[101];

void strToint(string a, int change[]) {
	for (int i = 0; i < a.size(); i++) {
		change[a.size() - i] = a[i] - '0';
	}
}

int main() {
	string s1="114514", s2="1919810";
	
	strToint(s1, a);
	strToint(s2, b);
	int len = s1.size()+s2.size();
	for (int i = 1; i <= s1.size(); i++) {
		for(int j=1;j<=s2.size();j++){
            c[i+j-1]+=a[i]*b[j];
            c[i+j]+=c[i+j-1]/10;
            c[i+j-1]%=10;
        }
	}
	while (c[len] == 0 && len > 1) {
		len--;
	}
	for (int i = len; i >= 1; i--) {
		cout << c[i] ;
	}
	return 0;
}