C++大数加减乘代码

#include <bits/stdc++.h>
#define endl '\n'
#define ll long long
#define cin std::cin
#define cout std::cout
const int N = 1e5 + 10;

std::string jia(std::string s1, std::string s2){
	// 保证s1是最长的字符串
    if (s1.size() < s2.size()) {
        swap(s1, s2);
    }

    // 将s2和s3填充到与s1相同的长度
    int diff = s1.size() - s2.size();
    s2 = std::string(diff, '0') + s2;
	std::string ans = "";
    int carry = 0;
    for (int i = s1.size() - 1; i >= 0; i--) {
        int tmp = (s1[i] - '0') + (s2[i] - '0') + carry;
        ans += std::to_string(tmp % 10);
        carry = tmp / 10;
    }

    // 如果最后一次计算有进位，加到结果中
    if (carry) {
        ans += std::to_string(carry);
    }

    // 将结果字符串逆序输出
    reverse(ans.begin(), ans.end());

	return ans;
}

void jian(std::string numa, std::string numb){

	int flag = 0;
	// 确保num1是较大的数字
	if (numa.length() < numb.length() ||
			(numa.length() == numb.length() && numa < numb)) {
		swap(numa, numb);
		flag = 1;
	}

	// 将两个数字填充到相同长度
	int diff = numa.length() - numb.length();
	numb = std::string(diff, '0') + numb;

	std::string result = "";
	int borrow = 0;

	// 从字符串的最后一位开始逐位相减
	for (int i = numa.length() - 1; i >= 0; --i) {
		int digit_diff = (numa[i] - '0') - (numb[i] - '0') - borrow;
		if (digit_diff < 0) {
			digit_diff += 10;
			borrow = 1;
		} else {
			borrow = 0;
		}
		result +=
			std::to_string(digit_diff); // 计算当前位的结果并加入到结果字符串中
	}

	// 结果字符串是逆序的，需要翻转过来
	reverse(result.begin(), result.end());

	// 去除结果字符串开头的多余的0
	result.erase(0, std::min(result.find_first_not_of('0'), result.size() - 1));

	if (flag == 1) {
		result = "-" + result;
	}

	cout << result << endl;
}

std::string multiply(std::string num1, std::string num2) {
    int n1 = num1.size();
    int n2 = num2.size();
	std::vector<int> result(n1 + n2, 0);

    reverse(num1.begin(), num1.end());
    reverse(num2.begin(), num2.end());

    for (int i = 0; i < n1; ++i) {
        for (int j = 0; j < n2; ++j) {
            int mul = (num1[i] - '0') * (num2[j] - '0');
            result[i + j] += mul;
            result[i + j + 1] += result[i + j] / 10;
            result[i + j] %= 10;
        }
    }

	std::string res;
    bool leadingZero = true;
    for (int i = result.size() - 1; i >= 0; --i) {
        if (leadingZero && result[i] == 0) {
            continue; // Skip leading zeros
        }
        leadingZero = false;
        res += std::to_string(result[i]);
    }

    return res.empty() ? "0" : res;
}

void solve();
int main(int argc, char *argv[]) {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	solve();

	return 0;
}

void solve() {
	int n;
	cin >> n;
	while (n--) {
		std::string num1, num2;
		cin >> num1 >> num2;
		cout << multiply(num1, num2) << " ";
	}
	cout << endl;
	// std::string num1, num2;
	// cin >> num1 >> num2;
	// cout << multiply(num1, num2) << endl;
}