（zz）还是大数乘法（c＋＋）

计算19238479821374872198374721983749213794879213749872314
乘以
19238759823175987123987491238408120348021834098129038590814329085081203840812384
结果输出为：
37012449264644883260550643512633299235197983885411332228570233264495097175737596
4591503650053025579798221486118662276589462029936576

整个过程仅须1秒（注：我的机器是Duron 800,256M RAM)
而且亦支持负数，如可输入:   -123847821347
=============================================
源代码如下：
#include <iostream>
#include <cstring>
#include <string>
#include <cassert>
#include <cstdlib>
typedef  int  ET;
typedef  struct  NODE{
    ET     data;    
    struct NODE * p;    
    struct NODE * n;
}NODE,*NODEH;
typedef struct LIST{
    NODEH head;    
    NODEH end;    
    int   length;
}LIST,*LISTH;


inline bool InitList(LISTH& L)
{  
    L=(LISTH)malloc(sizeof(LIST));    
    assert(L);    
    L->head = L->end = NULL;
    L->length=0;    
    return true;
}
inline NODEH NMalloc(const ET& elem)
{    
    NODEH temp=(NODEH)malloc(sizeof(NODE));    
    assert(temp);
    temp->data=elem;    
    return temp;
}    
inline bool PreAdd(LISTH& L,const ET& elem)
{    
    NODEH temp=NMalloc(elem);
    ++(L->length);    
    if(NULL==L->head&&NULL==L->end){
        temp->n=temp->p=NULL;        
        L->head=L->end=temp;
        return true;
    }          
    temp->p= NULL;    
    temp->n= L->head;
    L->head->p=temp;    
    L->head= temp;    
    return true;
}
inline bool EndAdd(LISTH& L,const ET& elem)
{    
    NODEH temp=NMalloc(elem);
    ++(L->length);    
    if(NULL==L->head&&NULL==L->end){
        temp->n=temp->p=NULL;
        L->head=L->end=temp;
        return true;
    }      
    temp->n=NULL;    
    temp->p=L->end;
    L->end->n=temp;    
    L->end=temp;    
    return true;
}
inline bool DestoryList(LISTH& L)
{    
    NODEH temp=L->head,it;
    if(temp==NULL){
        free(L);
        return true;
    }    
    while(temp!=L->end){
        it=temp;
        temp=temp->n;
        free(it);
    }
    free(temp);
    free(L);  
    return true;
}    
inline void PrintList(LISTH& L)
{    
    NODEH it=L->head,end=L->end;  
    if(it==NULL)return;  
    for(;it!=end;it=it->n)
        putchar(it->data+/'0/');
    putchar(it->data+/'0/');  
}
inline bool AddZero(LISTH& L,int count)
{  
    while(count--)EndAdd(L,0);
    return true;
}  
inline bool BitMul(LISTH& L,const int number,LISTH& NUM)
{    
    NODEH L_end=L->end;
    int status=0,temp;
    for(; L_end!=L->head ;L_end=L_end->p){
        temp= L_end->data * number + status;
        PreAdd(NUM, temp%10 );
        status= temp/10;                
    }
    temp= L->head->data * number + status;
    if(temp>10){
        PreAdd(NUM,temp%10 );
        PreAdd(NUM,temp/10);
    }
    else PreAdd(NUM,temp);      
    
    return true;
}  
inline bool ADD(const LISTH& La,LISTH& Lb)
{  
    NODEH pa=La->end,pb=Lb->end;
    int status=0;
    for(;pa!= La->head;pa=pa->p,pb=pb->p){
        if(pb==NULL){
            PreAdd(Lb,0);
            pb=Lb->head;
        }
        int sum=pa->data+pb->data+status;
        if(sum>=10){
            pb->data=sum%10;
            status=1;
        }
        else{
            pb->data=sum;
            status=0;
        }                                
    }
    if(pb==NULL){
        PreAdd(Lb,0);
        pb=Lb->head;
    }
        int sum= pa->data + pb->data +status;
    if( sum>=10){
        pb->data=sum%10;
        if(pb->p ==NULL){
            PreAdd(Lb,0);
            pb=Lb->head;
            pb->data=sum/10;
            return true;
        }
        pb=pb->p;
                if(pb==NULL){
                        PreAdd(Lb,0);
                        pb=Lb->head;
                }
        pb->data=sum/10;
                return true;
    }
        else  
    pb->data=sum;
    return true;        
}                    

inline void MUL(const char * a,const char *b)
{    
    LISTH CS=NULL;  
    LISTH BCS=NULL;
    LISTH NUM=NULL;
    assert(a&&b);
    assert(InitList(NUM));
    assert(InitList(CS)&&InitList(BCS));
    {        
        int sig=1;
        if(/'-/'==*a){
            ++a;          
            sig*=-1;
        }
        else if(/'+/'==*a) ++a;
        if(/'-/'==*b){
            ++b;
            sig*=-1;
        }
        else if(/'+/'==*b)
                        ++b;        
        if(sig<0)
                        putchar(/'-/');
    }        
    if(strcmp(a,b)>0){
        const char *pa= a,*pb=b;
        for(;/'//0/'!=*pa;++pa){
            int temp= *pa-/'0/';
            assert(EndAdd(BCS,temp) );
        }
        for(;/'//0/'!=*pb;++pb){
            int temp= *pb-/'0/';
            assert(EndAdd(CS,temp) );
        }
    }
    else {
        const char *pa= a,*pb=b;
        for(;/'//0/'!=*pa;++pa){
            int temp= *pa-/'0/';
            assert(EndAdd(CS,temp) );
        }
        for(;/'//0/'!=*pb;++pb){
            int temp= *pb-/'0/';
            assert(EndAdd(BCS,temp) );
        }
    }    
    NODEH cs_p= CS->end;
    int   bit = 0;
    for(; cs_p !=CS->head ; cs_p=cs_p->p){
        LISTH TEMP;
        InitList(TEMP);        
        BitMul(BCS,cs_p->data,TEMP);        
        AddZero(TEMP,bit);
        ADD(TEMP,NUM);                
        ++bit;
        DestoryList(TEMP);
    }    
    LISTH TEMP;
    InitList(TEMP);
    BitMul(BCS,cs_p->data,TEMP);        
    AddZero(TEMP,bit);
    ADD(TEMP,NUM);    
    PrintList(NUM);
    putchar(/'//n/');
  
    DestoryList(TEMP);
    DestoryList(BCS);
    DestoryList(CS);
    DestoryList(NUM);    
}                                  
int main(void)
{    
    std::string a,b;
    std::cin>>a;
    std::cin>>b;
    MUL(a.c_str(),b.c_str());
    
    system("pause");
    return 0;
}