UVA - 10106 Product

最新推荐文章于 2020-02-01 18:16:00 发布

苏摩夜

最新推荐文章于 2020-02-01 18:16:00 发布

阅读量369

点赞数

分类专栏：高精度运算文章标签： uva UVA - 10106 Product

本文链接：https://blog.csdn.net/zz_FreeSky/article/details/38706229

版权

高精度运算专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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 <iostream>
#include <cstring>
#include <cstdio>
#define N 1000
using namespace std;

char a[N], b[N];
int aa[N] = {0}, bb[N] = {0};
int c[N] = {0};
int main() {

	while (scanf("%s%s",a,b) != EOF ) {
		int len1 = strlen(a) - 1;
		int len2 = strlen(b) - 1;
		int t = 0;
		for (int i = len1; i >= 0; i--) 
			aa[t++] = a[i] - '0';
		t = 0;
		for (int i = len2; i >= 0; i--) 
			bb[t++] = b[i] - '0';

		for (int i = 0; i <= len1; i++)
			for(int j = 0; j <= len2; j++) {
				c[i + j] += aa[i] * bb[j];
			}
		t = 0;
		for (int i = 0; i < N; i++) {
			c[i] = c[i] + t;
			t = c[i] /10 ;
			c[i] = c[i] % 10;	
		}
		int k;
		for( k = N - 1; k > 0; k--) //不可以等于0，如果等于0，类似12 * 0 = 0，这种情况 ，就会出现不了
			if(c[k])
				break;
		for(; k>= 0; k--) 
			printf("%d",c[k]);	
			printf("\n");
			memset(aa,0,sizeof(aa));
			memset(bb,0,sizeof(bb));
			memset(a,0,sizeof(a));
			memset(b,0,sizeof(b));
			memset(c,0,sizeof(c));

	}

		return 0;

	}