高精度模板 bign类

//只支持正整数

//减法只能大数减小数

#include <iostream>
#include <string>
#include <cstring>
using namespace std;
const int maxn=3000;
struct bign
{
	public:
	
	int len,s[maxn];
	bign& operator=(const char* num);
	bign& operator=(int num);
	bign& operator +=(const bign& b);
	bign& operator *=(const bign& b);
	bign& operator -=(const bign& b);
	bign& operator /=(const bign& b);
	bign& operator %= (const bign &b);
	
	inline	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 !(*this>b)&&!(*this<b);}  
	bool operator!=(const bign &b)const{return !(*this==b);}  
	bool operator<=(const bign &b)const{return !(*this>b);}  
	bool operator>=(const bign &b)const{return !(b>*this);}  
	
	string str()const;
	void clean();
	
	bign(){memset(s,0,sizeof(s));len=1;}
	bign(int num){*this=num;}
	bign(const char* num){*this=num;}

};

bign& bign::operator=(const char* num)
{
	len=strlen(num);
	for(int i=0;i<=len;i++)
	s[i]=num[len-1-i]-'0';
	return *this;
}
bign& bign::operator=(int num)
{
	char s[maxn];
	sprintf(s,"%d",num);
	*this=s;
	return *this;
}

string bign::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;
}

bign operator +(const bign& a,const bign &b)
{  
    bign c;  
    c.len = 0;  
    for(int i = 0, g = 0; g || i < max(a.len, b.len); i++)  
    {  
        int x = g;  
        if(i < a.len) x += a.s[i];  
        if(i < b.len) x += b.s[i];  
        c.s[c.len++] = x % 10;  
        g = x / 10;  
    }  
    return c;  
}  

bign& bign::operator += (const bign &b)  
{  
    *this = *this + b;  
    return *this;  
}  
void bign::clean()  
{  
    while(len > 1 && !s[len-1]) len--;  
}  

bign operator * (const bign& a,const bign &b)
{  
    bign c;  
    c.len = a.len + b.len;  
    for(int i = 0; i < a.len; i++)  
    {  
        for(int j = 0; j < b.len; j++)  
        {  
            c.s[i+j] += a.s[i] * b.s[j];  
        }  
    }  
    for(int i = 0; i < c.len; i++)  
    {  
        c.s[i+1] += c.s[i]/10;  
        c.s[i] %= 10;  
    }  
    c.clean();  
    return c;  
}  

bign& bign::operator *= (const bign &b)  
{  
    *this = *this * b;  
    return *this;  
}  

bign operator -(const bign& a,const bign &b)  
{  
    bign c;  
    c.len = 0;  
    for(int i = 0, g = 0; i < a.len; i++)  
    {  
        int x = a.s[i] - g;  
        if(i < b.len) x -= b.s[i];  
        if(x >= 0) g = 0;  
        else  
        {  
            g = 1;  
            x += 10;  
        }  
        c.s[c.len++] = x;  
    }  
    c.clean();  
    return c;  
}  

bign& bign::operator -= (const bign &b)  
{  
    *this = *this - b;  
    return *this;  
}  

bign operator /(const bign& a,const bign &b)  
{  
    bign c, f = 0;  
    for(int i = a.len-1; i >= 0; i--)  
    {  
        f = f*10;  
        f.s[0] = a.s[i];  
        while(f >= b)  
        {  
            f -= b;  
            c.s[i]++;  
        }  
    }  
    c.len = a.len;  
    c.clean();  
    return c;  
}  
bign& bign::operator /= (const bign &b)  
{  
    *this  = *this / b;  
    return *this;  
}  

bign operator % (const bign& a,const bign &b)  
{  
    bign r = a/ b;  
    r = a - r*b;  
    return r;  
}  
bign& bign::operator %= (const bign &b)  
{  
    *this = *this % b;  
    return *this;  
}