大数加法+乘法

/****************************** 
作者:cncoderalex 
博客:http://blog.csdn.net/cncoderalex 
*******************************/

#include <iostream>
#include <memory>
#include <string>
#include <stack>
#include <algorithm>

using namespace std;

#define  MAXLEN  1000

struct BigInteger
{
	unsigned char m_Data[MAXLEN];
	int m_BitCount;
	
	BigInteger()
	{
		memset(m_Data, 0, sizeof(m_Data));
	}

	void Set(char *pStr)
	{
		int len = strlen(pStr);
		for (int i = len - 1; i >= 0; i--)
		{
			m_Data[len - i - 1] = pStr[i] - '0';
		}

		m_BitCount = len;
	}

	void Get(char pStr[MAXLEN])
	{
		int i = 0;
		for (i = 0; i < m_BitCount; i++)
		{
			pStr[i] = m_Data[m_BitCount - i - 1] + '0';
		}
		pStr[i] = 0;
	}

	BigInteger &operator + (const BigInteger &IntToAdd)
	{
		BigInteger BigIntSum;
		int i = 0, carry = 0;
		for (i = 0; i < this->m_BitCount || i < IntToAdd.m_BitCount; i++)
		{
			BigIntSum.m_Data[i] += this->m_Data[i] + IntToAdd.m_Data[i] + carry;
			BigIntSum.m_Data[i] %= 10;
			carry = BigIntSum.m_Data[i] / 10;
		}

		if (carry)
		{
			BigIntSum.m_Data[i++] = carry;
		}

		BigIntSum.m_BitCount = i;

		return BigIntSum;
	}

	BigInteger &operator * (const BigInteger &IntToMultiply)
	{
		BigInteger BigIntProduct;
		int temp = 0, i = 0, j = 0, carry = 0;
		for (i = 0; i < IntToMultiply.m_BitCount; i++)
		{
			carry = 0;
			for (j = 0; j < this->m_BitCount; j++)
			{
				temp = IntToMultiply.m_Data[i] * this->m_Data[j];
				BigIntProduct.m_Data[i + j] += temp + carry;
				carry = BigIntProduct.m_Data[i + j] / 10;
				BigIntProduct.m_Data[i + j] %= 10;
			}

			if (carry)
			{
				BigIntProduct.m_Data[i + j] = carry;
			}
		}

		for (i = MAXLEN - 1; i >= 0; i--)
		{
			if (BigIntProduct.m_Data[i] != 0)
			{
				BigIntProduct.m_BitCount = i + 1;
				break;
			}
		}

		return BigIntProduct;
	}
};


int main()
{
	printf("http://blog.csdn.net/cncoderalex");
	printf("\n");

	char str1[MAXLEN], str2[MAXLEN], strSum[MAXLEN], strProduct[MAXLEN];
	while (scanf("%s%s", str1, str2) != EOF)
	{
		BigInteger BigInt1, BigInt2, BigIntSum, BigIntProduct;
		BigInt1.Set(str1);
		BigInt2.Set(str2);
		BigIntSum = BigInt1 + BigInt2;
		BigIntProduct = BigInt1 * BigInt2;
		BigIntSum.Get(strSum);
		BigIntProduct.Get(strProduct);

		printf("    Sum = %s\n", strSum);
		printf("Product = %s\n", strProduct);
	}

	system("pause");

	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值