51Nod1027 大数乘法

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#define N 2002
using namespace std;
void BigMul(char *f,char *m,char *final){
	int i,j,k,tmp_result,lensum;
	int lena=strlen(f);
	int lenb=strlen(m);
	lensum=lena+lenb;
	for(i=0;i<lena;i++)
		f[i]-='0';
	for(i=0;i<lenb;i++)
		m[i]-='0';
	char *result;
	result=(char *)calloc((lensum+1),sizeof(char));
	for(i=0;i<lena;i++){
		for(j=0;j<lenb;j++){
			tmp_result=f[lena-i-1]*m[lenb-j-1];
			result[i+j]+=tmp_result;
		}
		for(k=0;k<=i+j-1;k++){
			if(result[k]>9){
				int item;
				item=result[k]/10;
				result[k]%=10;
				result[k+1]+=item;
			}
		}
	}
	j=0;
	if(result[lensum-1]!=0){
		final[j++]=result[lensum-1]+'0';
	}
	
	for(i=lensum-2;i>=0;i--){
		final[j++]=result[i]+'0';
	}
	final[j]='\0';				
}
int main()
{
	char a[N],b[N],ans[N];
	cin>>a>>b;
	BigMul(a,b,ans);
	cout<<ans<<endl;
	return 0;
}