[带符号大整数模板]vector版

 #include <iostream>
 #include <cstdio>
 #include <vector>
 #include <cstring>

 using namespace std;

 typedef vector<int> vi;
 typedef long long LL;

 const int maxI = 1e8;
 const int Len = ;

 struct BigInt {

     vi num;
     bool symbol;

     BigInt() { num.clear(); symbol = ; }
     BigInt(int x) { symbol = ; if (x < ) { symbol = ; x = -x; } num.push_back(x % maxI); if (x >= maxI) num.push_back(x / maxI); }
     BigInt(bool s, vi x) { symbol = s;  num = x; }
     BigInt(char s[]) {
         int len = strlen(s), x = , sum = , p = s[] == '-';
         symbol = p;
         for (int i = len - ; i >= p; i--) {
             sum += (s[i] - '') * x;
             x *= ;
             if (x == 1e8 || i == p) {
                 num.push_back(sum);
                 sum = ;
                 x = ;
             }
         }
         while (num.back() ==  && num.size() > ) num.pop_back();
     }

     void push(int x) { num.push_back(x); }

     BigInt abs() const { return BigInt(false, num); }

     bool smaller(const vi &a, const vi &b) const {
         if (a.size() != b.size()) return a.size() < b.size();
         for (int i = a.size() - ; i >= ; i--) {
             if (a[i] != b[i]) return a[i] < b[i];
         }
         return ;
     }

     bool operator < (const BigInt &p) const {
         if (symbol && !p.symbol) return true;
         if (!symbol && p.symbol) return false;
         if (symbol && p.symbol) return smaller(p.num, num);
         return smaller(num, p.num);
     }

     bool operator > (const BigInt &p) const {
         return p < *this;
     }

     bool operator == (const BigInt &p) const {
         return !(p < *this) && !(*this < p);
     }

     bool operator >= (const BigInt &p) const {
         return !(*this < p);
     }

     bool operator <= (const BigInt &p) const {
         return !(p < *this);
     }

     vi add(const vi &a, const vi &b) const {
         vi c;
         c.clear();
         int x = ;
         for (int i = ; i < a.size(); i++) {
             x += a[i];
             if (i < b.size()) x += b[i];
             c.push_back(x % maxI);
             x /= maxI;
         }
         for (int i = a.size(); i < b.size(); i++) {
             x += b[i];
             c.push_back(x % maxI);
             x /= maxI;
         }
         if (x) c.push_back(x);
         while (c.back() ==  && c.size() > ) c.pop_back();
         return c;
     }

     vi sub(const vi &a, const vi &b) const {
         vi c;
         c.clear();
         int x = ;
         for (int i = ; i < b.size(); i++) {
             x += maxI + a[i] - b[i] - ;
             c.push_back(x % maxI);
             x /= maxI;
         }
         for (int i = b.size(); i < a.size(); i++) {
             x += maxI + a[i] - ;
             c.push_back(x % maxI);
             x /= maxI;
         }
         while (c.back() ==  && c.size() > ) c.pop_back();
         return c;
     }

     vi mul(const vi &a, const vi &b) const {
         vi c;
         c.resize(a.size() + b.size());
         for (int i = ; i < a.size(); i++) {
             for (int j = ; j < b.size(); j++) {
                 LL tmp = (LL)a[i] * b[j] + c[i + j];
                 c[i + j + ] += tmp / maxI;
                 c[i + j] = tmp % maxI;
             }
         }
         while (c.back() ==  && c.size() > ) c.pop_back();
         return c;
     }

     vi div(const vi &a, const vi &b) const {
         vi c(a.size()), x(, ), y(, ), z(, ), t(, );
         y.push_back();
         for (int i = a.size() - ; i >= ; i--) {
             z[] = a[i];
             x = add(mul(x, y), z);
             if (smaller(x, b)) continue;
             int l = , r = maxI - ;
             while (l < r) {
                 int m = (l + r + ) >> ;
                 t[] = m;
                 if (smaller(x, mul(b, t))) r = m - ;
                 else l = m;
             }
             c[i] = l;
             t[] = l;
             x = sub(x, mul(b, t));
         }
         while (c.back() ==  && c.size() > ) c.pop_back();
         return c;
     }

     BigInt operator + (const BigInt &p) const{
         if (!symbol && !p.symbol) return BigInt(false, add(num, p.num));
         if (!symbol && p.symbol) return *this >= p.abs()? BigInt(false, sub(num, p.num)) : BigInt(true, sub(p.num, num));
         if (symbol && !p.symbol) return (*this).abs() > p? BigInt(true, sub(num, p.num)) : BigInt(false, sub(p.num, num));
         return BigInt(true, add(num, p.num));
     }

     BigInt operator - (const BigInt &p) const {
         return *this + BigInt(!p.symbol, p.num);
     }

     BigInt operator * (const BigInt &p) const {
         BigInt res(symbol ^ p.symbol, mul(num, p.num));
         if (res.symbol && res.num.size() ==  && res.num[] == ) res.symbol = false;
         return res;
     }

     BigInt operator / (const BigInt &p) const {
         if (p == BigInt()) return p;
         BigInt res(symbol ^ p.symbol, div(num, p.num));
         if (res.symbol && res.num.size() ==  && res.num[] == ) res.symbol = false;
         return res;
     }

     BigInt operator % (const BigInt &p) const {
         return *this - *this / p * p;
     }

     void show() const {
         if (symbol) putchar('-');
         printf("%d", num[num.size() - ]);
         for (int i = num.size() - ; i >= ; i--) {
             printf("%08d", num[i]);
         }
         putchar('\n');
     }

     int TotalDigit() const {
         int x = num[num.size() - ] / , t = ;
         while (x) {
             x /= ;
             t++;
         }
         return t + (num.size() - ) * Len;
     }

 };