高精度非负整数



#include <stdio.h>
#include <string.h>
#include <math.h>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 10005;
const int Mod = 1000000007;
struct bign
{
	int len,s[maxn];
	bign(){ memset( s,0,sizeof(s) ); len = 1; }
	bign( int num ) { *this = num; }
	bign( const char *num ){ *this = num; }
	bign operator = ( const char *num )
	{
		len = strlen( num );
		for( int i = 0; i < len; i ++ )	s[i] = num[len-i-1] - '0';
		return *this;
	}
	bign operator = ( int num )
	{
		char s[maxn];
		sprintf( s,"d",num );
		*this = s;
		return *this;
	}
	bign operator + ( const bign& b ) const
	{
		bign c;
		c.len = 0;
		for( int i = 0,g = 0; g || i < max( len,b.len ); i ++ )
		{
			int x = g;
			if( i < len	)	x += s[i];
			if( i < b.len )	x += b.s[i];
			c.s[c.len++] = x%10;
			g = x/10;
		}
		return c;
	}
	bool operator < ( const bign& b ) const
	{
		if( len != b.len )	return len < b.len;
		for( int i = len-1; i >= 0; i -- )
			if( s[i] != b.s[i] )
				return s[i] < b.s[i];
		return false;
	}
	bool operator > ( const bign& b ) const
	{
		return b < *this;
	}
	bool operator <= ( const bign& b ) const
	{
		return !( b < *this );
	}
	bool operator >= ( const bign& b ) const
	{
		return !( *this < b );
	}
	bool operator == ( const bign& b ) const
	{
		if( len != b.len )	return false;
		for( int i = 0; i < len; i ++ )
			if( s[i] != b.s[i] )
				return false;
		return true;
	}
	bool operator != ( const bign& b ) const
	{
		return !( *this == b );
	}
	string str() const
	{
		string res = "";
		for( int i = 0; i < len; i ++ )
			res = (char)( s[i] + '0' ) + res;
		if( res == "" )	 res = "0";
		return res;
	}
};
istream& operator >> ( istream &in,bign& x )
{
	string s;
	in >> s;
	x = s.c_str();
	return in;
}
ostream& operator << ( ostream &out,const bign& x )
{
	out << x.str();
	return out;
}
int main()
{
	#ifndef ONLINE_JUDGE    
	//freopen("data.txt","r",stdin);    
	#endif 
	bign a,b;
	cin >> a >> b;
	cout << a+b<<endl;
	return 0;
}


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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值