高精乘法

#include<iostream>
#include<string>
using namespace std;
string a, b;
int an[2005], bn[2005];
int ans[4010];
int main()
{
 cin >> a >> b;
 int alen = a.size();
 int blen = b.size();
 for (int i = 0; i < a.size(); i++) {
  an[alen--] = a[i] - '0';
 }
 for (int i = 0; i < b.size(); i++) {
  bn[blen--] = b[i] - '0';
 }
 alen = a.size();
 blen = b.size();
 for (int i = 1; i <= alen; i++) {
  for (int j = 1; j <= blen; j++) {
   ans[i + j - 1] += an[i] * bn[j];
   ans[i + j] += ans[i + j - 1] / 10;
   ans[i + j - 1] %= 10;
  }
 }
 int anslen = alen + blen;
 while (anslen > 1) {
  if (ans[anslen] > 0)
   break;
  anslen--;
 }
 for (int i = anslen; i >= 1; i--) {
  cout << ans[i];
 }
 return 0;
}