POJ-2389-Bull Math（高精度乘法）

Description

Bulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are correct. Help him check the bulls' answers. Read in two positive integers (no more than 40 digits each) and compute their product. Output it as a normal number (with no extra leading zeros). 

FJ asks that you do this yourself; don't use a special library function for the multiplication.

Input

* Lines 1..2: Each line contains a single decimal number.

Output

* Line 1: The exact product of the two input lines

Sample Input

11111111111111
1111111111

Sample Output

12345679011110987654321

---

高精度乘法模板，注意不输出前导0。

---

//高精度×高精度 
#include<iostream>
#include<cstring>
using namespace std;
int a[50],b[50],c[100];
int la,lb,lc;
int mult(int a[],int b[]){
    lc=la+lb+1;    //注意位数 
    for(int i=0;i<la;i++){
        for(int j=0;j<lb;j++){
            c[i+j]=c[i+j]+a[i]*b[j];
            c[i+j+1]=c[i+j+1]+c[i+j]/10;
            c[i+j]=c[i+j]%10;
        }
    }
    if(!c[lc]) lc--;
    return 0;
    
}

int main(){
    
    //读入
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b)); 
    memset(c,0,sizeof(c));
    string s1,s2;
    cin>>s1>>s2;
    la=s1.length();
    lb=s2.length();
    
    for(int i=0;i<la;i++){
        a[i]=s1[la-i-1]-'0';
    }
    for(int i=0;i<lb;i++){
        b[i]=s2[lb-i-1]-'0';
    }
    
    mult(a,b);
    int flag=1;
    for(int i=lc-1;i>=0;i--){
        if(flag&&c[i]==0) continue;// 前导0不输出； 
        else {
            cout<<c[i];
            flag=0; 
        }    
    }
    
    return 0;
}