3117 高精度练习之乘法

#include <iostream>
#include<cstring>
using namespace std;

string mul(string a,string b)
{
    int *tem;
    char *re;
    string result;
    unsigned i,j;
    if(a == "0" || b == "0")
    {
        result = "0";
        return result;
    }
    tem = new int[a.length() + b.length()];
    re = new char[a.length() + b.length() + 1];
    for(i = 0; i < a.length() + b.length(); i++)tem[i] = 0;
    for(i = 0; i < a.length() + b.length() + 1; i++)re[i] = '\0';

    for(i = 0; i < a.length(); i++)
        for(j = 0; j < b.length(); j++)
            tem[i + j + 1] += (a[i] - '0') * (b[j] - '0');//这里一开始写成(a[i] - '0') * (b[i] - '0') 囧

//      for(i = 0; i < a.length() + b.length(); i++)
//          cout<<tem[i]<<" ";
//          cout<<endl;

    for(i = a.length() + b.length() - 1; i > 0; i--)
    {
        if(tem[i] >= 10)
        {
            tem[i-1] += tem[i] / 10;
            tem[i] %= 10;
        }
    }
//    for(i = 0; i < a.length() + b.length(); i++)
//        cout<<tem[i]<<" ";
//    cout<<endl;

    unsigned k = 0;
    while(tem[k] == 0)k++;
    for(i = k; i < a.length() + b.length(); i++)re[i-k] = tem[i] + '0';
    re[i-k] = '\0';
    result = re;
    return result;
}

int main()
{
    string a,b;
    cin>>a>>b;
    cout<<mul(a,b);
    return 0;
}

<pre name="code" class="cpp">这个是别人的一个C++版，感觉挺不错的，在我做大数乘法很有帮助  原文（http://blog.csdn.net/pqleo/article/details/23866397）

//然后借鉴大神的代码，自己打了一个C版的

#include <stdio.h>
#include <stdlib.h>
#include<string.h>
int main()
{
    char a[500], b[500];
    int c[1000], i, j, n1, n2, n3;
    scanf ( "%s%s", &a, &b );
    memset(c,0,sizeof(int )*999);
    n1 = strlen ( a );
    n2 = strlen ( b );
    n3 = n1 + n2 ;
    for ( i = 0; i < n1; i++ ) for ( j = 0; j < n2; j++ ) c[i + j + 1] += ( a[i] - '0' ) * ( b[j] - '0' );
    for ( i = n3 - 1; i >= 1; i-- )
        if ( c[i] >= 10 ) {
            c[i - 1]+=c[i]/10;
            c[i]%=10;
        }
    if(c[0]!=0)printf("%d",c[0]);
    for(i=1;i<n3;i++)printf("%d",c[i]);
    return 0;
}