P1303 A*B Problem

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

char a1[50001], b1[50001];
int a[50001], b[50001], c[50001];

int main(){
	scanf("%s", a1);
	scanf("%s", b1);
	int lena = strlen(a1);
	int lenb = strlen(b1);
	for(int i = 1; i <= lena; i++) a[i] = a1[lena - i] - '0';
	for(int i = 1; i <= lenb; i++) b[i] = b1[lenb - i] - '0';
	for(int i = 1; i <= lena; i++){
		for(int j = 1; j <= lenb; j++){
			c[i + j - 1] += a[i] * b[j];
		}	
	}
	int len = lena + lenb;
	for(int i = 1; i <= len; i++) if(c[i] > 9){
		c[i + 1] += c[i] / 10;
		c[i] = c[i] % 10;
	}
	while(c[len] == 0 && len > 1) len--;
	for(int i = len; i >= 1; i--) printf("%d", c[i]);
	return 0;
}