高精度板子

#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<iostream>
using namespace std;
struct Bigzhenshu
{
    static const int base=10000;
    static const int width=4;
    vector<int> s;
    Bigzhenshu(long long  num=0) {*this=num;}
    Bigzhenshu operator =(long long num)
    {
        s.clear();
        do {
            s.push_back(num%base);
            num/=base;
        }while(num>0);
        return *this;
    }
    Bigzhenshu operator =(const string &str)
    {
        s.clear();
        
        int x,len=(str.length()-1)/width+1;
        for(int i=0;i<len;i++) {
            int end = str.length() - i * width;
            int start = max(0, end - width);
            sscanf(str.substr(start, end - width).c_str(), "%d", &x);
            s.push_back(x);
        }
        return *this;
    }
//    return *this;/


    Bigzhenshu operator + (const Bigzhenshu &b)const{
        Bigzhenshu 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.size();
            c.s.push_back(x%base);
            g=x/=base;
        }
        return c;
    }
    Bigzhenshu operator +=(const Bigzhenshu &b)
    {
        *this=*this+b;return *this;
    }

};
istream& operator >> (istream &in,Bigzhenshu &x)
{
    string s;
    if(!(in>>s)) return in;
    x=s;
    return in;
}
ostream& operator <<(ostream &out,Bigzhenshu &x)
{
    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];
        }
    }
}
int main()
{
    return 0;
}