算法竞赛入门经典 5.2.3高精度运算类bign(BigN)

#include <cstdio>
#include <cstring>
#include <string>
const int maxn = 1000;
struct bign{
	int len;
	int s[maxn];
	bign(){
		memset(s, 0, sizeof(s));
		len = 1;
	}
	bign(int num){ *this = num; }
	bign(const char *num){ *this = num; }
	bign operator=(const char *num){
		len = strlen(num);
		for (int i = 0; i < len; ++i){
			s[i] = num[len - i - 1] - '0';
		}
		return *this;
	}
	bign operator=(int num){
		char tmp[maxn];
		sprintf(tmp, "%d", num);
		*this = tmp;//不能删这行
		return *this;
	}
	std::string str() const{
		std::string res("");
		for (int i = 0; i < len; ++i){
			res = char(s[i] + '0') + res;
		}
		if (res == "") return "0";
		return res;
	}
	//std::istream& operator>>(std::istream &in, bign &x){
	//	string s;
	//	in >> s;
	//	x = s.c_str();
	//	return in;
	//}
	//std::ostream& operator<<(std::ostream &out, bign &x){
	//	out << x.str();
	//	return out;
	//}
	bign operator+(const bign &b) const{
		bign res;
		res.len = 0;
		for (int i = 0, c = 0; c || i < max(len, b.len); ++i){
			int tmp = c;
			if (i < len) tmp += s[i];
			if (i < b.len) tmp += b.s[i];
			res.s[res.len++] = tmp % 10;
			c = tmp / 10;
		}
		return res;
	}
	bign operator+=(const bign &b){
		*this = *this + b;
		return *this;
	}
	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 !(b < *this);
	}
	bool operator>=(const bign &b) const{
		return !(*this < b);
	}
	bool operator!=(const bign &b) const{
		return *this > b || *this < b;
	}
	bool operator==(const bign &b) const{
		return !(*this > b) && !(*this < b);
	}
};
int main(){
	return 0;
}