高精度类（刘如佳模板）

只提供（*+><等运算其他要只写）其他要自己写！！！

 

 

#include<cstdio>
#include<iostream>
#include<string.h>
using namespace std;

const int maxn = 200;
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 = (int num) {//直接以整数赋值
    char s[maxn];
    sprintf(s, "%d", num);
    *this = s;
    return *this;
  }

  bign operator = (const char* num) {//以字符串赋值
    len = strlen(num);
    for(int i = 0; i < len; i++) s[i] = num[len-i-1] - '0';
    return *this;
  }

  string str() const {//将bign转化成字符串
    string res = "";
    for(int i = 0; i < len; i++) res = (char)(s[i] + '0') + res;
    if(res == "") res = "0";
    return res;
  }

  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;
  }

  void clean() {//去掉前到0
    while(len > 1 && !s[len-1]) len--;
  }

  bign operator * (const bign& b) {//重载*号运算
    bign c; c.len = len + b.len;
    for(int i = 0; i < len; i++)
      for(int j = 0; j < b.len; j++)
        c.s[i+j] += s[i] * b.s[j];
    for(int i = 0; i < c.len-1; i++){
      c.s[i+1] += c.s[i] / 10;
      c.s[i] %= 10;
    }
    c.clean();
    return c;
  }

  bign operator - (const bign& b) {//重载-号运算
    bign c; c.len = 0;
    for(int i = 0, g = 0; i < len; i++) {
      int x = 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;
  }

  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) {//重载<=号运算
    return !(b > *this);
  }

  bool operator == (const bign& b) {//重载>=号运算
    return !(b < *this) && !(*this < b);
  }

  bign operator += (const bign& b) {//重载+=号运算
    *this = *this + b;
    return *this;
  }
};

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() {
  bign a;
  cin >> a;
  a += "123456789123456789000000000";
  a=a*1000000000;
  cout << a << endl;
  return 0;
}

 

 

 

大数除法！！！！！

//注：此算法是用字符串处理的，等有空的时候在改成bign类型

void Div(char *str1, char *str2, char *str3){
  int  i1, i2, i, j, jj, tag, carry, cf, c[MAXSIZE];
  int  len1 = strlen(str1), len2 = strlen(str2), lend;
  char  d[MAXSIZE];
 
  memset(c, 0, sizeof(c));
  memcpy(d, str1, len2); //把从str1指向的串复制len2长度到d指向的内容；
  lend = len2; j = 0;
 
  for( i1=len2-1; i1 < len1; ++i1 ){
    if( lend < len2 ){
      d[lend] = str1[i1+1]; c[j] = 0;
   ++j; ++lend;
  }
    else if( lend == len2 ){
   jj = 1;
      for( i=0; i < lend; ++i ){
        if( d[i] > str2[i] ) break;
        else if( d[i] < str2[i] ){
     jj = 0; break;
    }
   }
      if( jj == 0 ){
        d[lend] = str1[i1+1]; c[j] = 0;
    ++j; ++lend;
    continue;
   }
  }
    if( jj==1 || lend > len2 ){
   cf = jj=0;
      while( d[jj] <= '0' && jj < lend ) ++jj;
      if( lend-jj > len2 ) cf = 1;
      else if( lend-jj < len2 ) cf = 0;
   else{
        i2 = 0; cf = 1;
        for( i=jj; i < lend; ++i ){
     if( d[i] < str2[i2] ){
      cf = 0; break;
     }
     else if( d[i] > str2[i2] ){
      break;
     }
     ++i2;
    }
   }//else
   while( cf ){
        i2 = len2-1; cf = 0;
        for( i=lend-1; i >= lend-len2; --i ){
     d[i] = d[i]-str2[i2]+'0';
     if( d[i] < '0' ){
      d[i] = d[i]+10; carry = 1;
      --d[i-1];
     }
     else carry = 0;
     --i2;
    }
    ++c[j]; jj=0;
        while( d[jj] <= '0' && jj < lend ) ++jj;
        if( lend-jj > len2 ) cf = 1;
        else if( lend-jj < len2 ) cf = 0;
    else{
     i2 = 0; cf = 1;
          for( i=jj; i < lend; ++i ){
      if( d[i] < str2[i2] ){
       cf = 0; break;
      }
      else if( d[i] > str2[i2] ){
       break;
      }
      ++i2;
     }
     
    }//else
   }//while
   jj = 0;
      while( d[jj] <= '0' && jj < lend ) ++jj;
for( i=0;i < lend-jj; ++i ) d[i] = d[i+jj];
      d[i] = str1[i1+1];  lend = i+1;
   ++j;
  }//else
 }//for
  i = tag = 0;
  while( c[i] == 0 ) ++i;
  for( ; i < j; ++i, ++tag ) str3[tag] = c[i]+'0';
  str3[tag] = '/0';
}