大整数乘法

#include<iostream>
#include<cstring>
using namespace std;
char s1[1005], s2[1005];
int n1[1005], n2[1005], ans[2005];

int main() {
    cin >> s1 >> s2;
    n1[0] = strlen(s1);
    n2[0] = strlen(s2);
    for (int i = 1, j = n1[0] - 1; i <= n1[0]; ++i, --j)
        n1[i] = s1[j] - '0';
    for (int i = 1, j = n2[0] - 1; i <= n2[0]; ++i, --j)
        n2[i] = s2[j] - '0';
    ans[0] = n1[0] + n2[0] - 1; // 两个数相乘最小的位数
    for (int i = 1; i <= n1[0]; ++i) 
        for (int j = 1; j <= n2[0]; ++j) 
            ans[i + j - 1] += n1[i] * n2[j]; //乘法运算放在i+j-1位上
    for (int i = 1; i <= ans[0]; ++i) 
        if (ans[i] > 9) {
            ans[i + 1] += ans[i] / 10;
            ans[i] %= 10;
            if (i == ans[0]) ++ans[0];
        }
    for (int i = ans[0]; i > 0; --i)
        cout << ans[i];
    cout << endl;
    return 0;
}