long multiplication

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int MAX_SIZE = 500; // максимальная длина произведения

int main() {
    int c[MAX_SIZE] = {};
    string num1, num2;
    cin >> num1 >> num2;
    reverse(num1.begin(), num1.end());
    reverse(num2.begin(), num2.end());
    int length = num1.size() + num2.size() + 1;

    for (int i = 0; i < num1.size(); i++)
        for (int j = 0; j < num2.size(); j++) {
            c[i + j] += (int(num1[i]) - 48) * (int(num2[j]) - 48);
        }
    for (int i = 0; i < length; i++) {
        c[i + 1] += c[i] / 10;
        c[i] %= 10;
    }
    while (c[length] == 0) length--;
    while (length >= 0) cout << c[length], length--;
    cout << endl;
    return 0;
}