△UVA10106

 Product 

 

The Problem

The problem is to multiply two integers X, Y. (0<=X,Y<10²⁵⁰)

The Input

The input will consist of a set of pairs of lines. Each line in pair contains one multiplyer.

The Output

For each input pair of lines the output line should consist one integer the product.

Sample Input

 

12
12
2
222222222222222222222222

 

Sample Output

 

144
444444444444444444444444

#include<cstdio>
#include<string.h>

#define maxn 2005

int main()
{
    char a[maxn],b[maxn];
    int ans[maxn];
    int i,j,k;
    int la,lb;
    while(scanf("%s%s",a,b) != EOF)
    {
        la=strlen(a);
        lb=strlen(b);
        memset(ans,0,sizeof(ans));
        for(i=la-1;i>=0;i--)
        {
            for(j=lb-1,k=la-1-i;j>=0;j--)//大数相乘模拟手算，关键在于错位，即k=la-1-i
            {
                ans[k++] += (a[i]-'0')*(b[j]-'0');//ans[0]存的是个位，ans[1]存的是十位，ans[2]存的是百位……
            }
        }
        for(i=0;i<maxn-1;i++)
        {
            if(ans[i]>9)//进位
            {
                ans[i+1]+=ans[i]/10;//因为是乘法，不再像加法一样是进1还是不进位了
                ans[i]%=10;//只留一位
            }
        }
        for(i=maxn-1;i>=0;i--)
        {
            if(ans[i])//忽略前导0
                break;
        }
        if(i>=0)
        {
            for(;i>=0;i--)
            {
                printf("%d",ans[i]);
            }
        }
        else
            printf("0");
        printf("
");
    }
    return 0;
}