刘汝佳的《算法竞赛入门经典》(第二版)中的大整数类
#include <string>
#include <algorithm>
#include <cstring>
#include <vector>
#include <iostream>
#include <cstdio>
using namespace std;
//大整数类 存贮高精度非负整数
struct BigInteger
{
//若int为32位整数,范围是-2147483648~2147483647
static const int BASE =100000000;
static const int WIDTH=8;
vector<int> s;
BigInteger(){}
BigInteger(long long num)
{
*this=num;
}
BigInteger operator=(long long num);
BigInteger operator=(const string& str);
friend ostream& operator<<(ostream &out,const BigInteger& x);
BigInteger operator+(const BigInteger& b)const;
BigInteger operator += (const BigInteger& b);
bool operator<(const BigInteger& b)const;
bool operator>(const BigInteger& b)const {return b<*this;}
bool operator<=(const BigInteger& b)const {return !(b<*this);}
bool operator>=(const BigInteger& b)const {return !(*this<b);}
bool operator!=(const BigInteger& b)const {return b<*this||*this<b;}
bool operator==(const BigInteger& b)const {return !(b<*this)&&!(*this<b);}
};
BigInteger BigInteger::operator =(long long num)
{
s.clear();
//逆序存放数字段
do
{
s.push_back(num%BASE);
num/=BASE;
}while(num>0);
return *this;
}
BigInteger BigInteger::operator=(const string& str)
{
s.clear();
//对str.length()/WIDTH向上取整
int x,len=(str.length()-1)/WIDTH+1;
int flag=1;
for(int i=0;i<len;i++)
{
//End为要取的字符串结尾的位数
int End =str.length()-i*WIDTH;
//开头位数
int Start =max(0,End-WIDTH);
sscanf(str.substr(Start,End-Start).c_str(),"%d",&x);
//逆序存放数字段
//此处是为了处理00000000008+8等情况
if(flag||x)
{
if(x!=0) flag=0;
s.push_back(x);
}
}
return *this;
}
ostream& operator<<(ostream &out,const BigInteger& x)
{
//输出最高位对应的八个单元,因为不需要前导0,所以直接用int形式输出即可
out<<x.s.back();
for(int i=x.s.size()-2;i>=0;i--)
{
char buf[20];
sprintf(buf,"%08d",x.s[i]);
for(int j=0;j<strlen(buf);j++) out<<buf[j];
}
return out;
}
istream& operator>>(istream &in,BigInteger& x)
{
string s;
//处理输入失败
if(!(in>>s)) return in;
x=s;
return in;
}
BigInteger BigInteger::operator+(const BigInteger& b)const
{
BigInteger c;
c.s.clear();
for(int i=0,g=0;;i++)
{
if(g==0&&i>=s.size()&&i>=b.s.size()) break;
int x=g;
if(i<s.size()) x+=s[i];
if(i<b.s.size()) x+=b.s[i];
c.s.push_back(x%BASE);
g=x/BASE;
}
return c;
}
BigInteger BigInteger::operator +=(const BigInteger& b)
{
*this=*this+b;
return *this;
}
bool BigInteger::operator<(const BigInteger& b)const
{
if(s.size()!=b.s.size()) return s.size()<b.s.size();
for(int i=s.size()-1;i>=0;i--)
if(s[i]!=b.s[i]) return s[i]<b.s[i];
return false;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int kase;
string a,b;
BigInteger c,d;
cin>>kase;
for(int i=1;i<=kase;i++)
{
if(i!=1) cout<<endl;
cin>>a>>b;
c=a,d=b;
cout<<"Case "<<i<<":"<<endl;
cout<<a<<" + "<<b<<" = "<<c+d<<endl;
}
return 0;
}