BZOJ3767 A+B Problem加强版 解题报告

题目链接

BZOJ3767: A+B Problem加强版

解题思路

一道非常简单恶心的高精模板题

有正负的高精不是人做的——hwr

看看吧，压8位，实则是一大壮举

详细代码

#define USEFASTERREAD 0

#define rg register
#define inl inline
#define DEBUG printf("[Passing [%s] in line %d.]\n", __func__, __LINE__)
#define putline putchar('\n')
#define putsp putchar(' ')
#define Rep(a, s, t) for(rg int a = s; a <= t; a++)
#define Repdown(a, t, s) for(rg int a = t; a >= s; a--)
typedef long long ll;
#include<cstdio>

#if USEFASTERREAD
char In[1 << 20], *ss = In, *tt = In;
#define getchar() (ss == tt && (tt = (ss = In) + fread(In, 1, 1 << 20, stdin), ss == tt) ? EOF : *ss++)
#endif
struct IO {
	void RS() {freopen("test.in", "r", stdin), freopen("test.out", "w", stdout);} 
	template<typename T> inline IO r(T& x)const	{
	    x = 0; T f = 1; char ch = getchar();
	    for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
	    for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + int(ch - '0');
	    x *= f; return *this;
	}
	template<typename T> inline IO w(T x)const {
	    if(x < 0) {putchar('-'); x = -x;}
	    if(x >= 10) w(x / 10);
	    putchar(x % 10 + '0'); return *this;
	}
	template<typename T> inline IO wl(const T& x)const {w(x), putline; return *this;}
	template<typename T> inline IO ws(const T& x)const {w(x), putsp; return *this;}
	inline IO l() {putline; return *this;}
	inline IO s() {putline; return *this;}
}io;
template<typename T> inline T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> inline T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> inline void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}
template<typename T> inline T Abs(const T& x) {return x > 0 ? x : -x;} 
#include<cstring>
const int MAXLEN = 10000005;
const int NN = 100000000, N = 8;

char pool[MAXLEN];
struct Bigint {
	ll A[MAXLEN / N + 5];
	int len;
	int f;
	Bigint() {
		memset(A, 0x00, sizeof A);
		len = 1;
		f = 1;
	}
	void Read() {
		int flag = 0;
		*this = Bigint();
		scanf("%s", pool);
		if(pool[0] < '0' || pool[0] > '9') flag = 1;
		if(pool[0] == '-') f = -1;
		len = 0;
		for(rg int i = strlen(pool+flag) - 1; i >= 0; i -= N) {
			int j = (i >= N - 1) ? i - N + 1 : 0;
			for(rg int k = j; k <= i; k++) A[len] = A[len] * 10 + int((pool+flag)[k] - '0');
			len++;
		}
	}
	void Write() {
		if(f == -1 && !(len == 1 && A[0] == 0)) putchar('-');
		io.w(A[len - 1]);
		for(rg int i = len - 2; i >= 0; i--) {
			for(rg int k = NN / 10; A[i] < k; k /= 10) putchar('0');
			if(A[i]) io.w(A[i]);
		}
	}
	ll& operator [] (const int& k) {return A[k];}
	ll operator [] (const int& k)const {return A[k];}
	friend Bigint Plus(const Bigint& A, const Bigint& B) {//满足同号，不算符号 
		Bigint C;
		C.len = Max(A.len, B.len);
		for(rg int i = 0; i < C.len; i++) {
			C[i] += A[i] + B[i];
			C[i + 1] += C[i] / NN;
			C[i] %= NN;
		}
		if(C[C.len]) C.len++;
		while(C[C.len - 1] == 0 && C.len > 1) C.len--;
		return C;
	}
	friend Bigint Minus(const Bigint& A, const Bigint& B) {//同号，|A|>|B| ,不算符号
		Bigint C;
		C.len = A.len;
		for(rg int i = 0; i < C.len; i++) {
			C[i] += A[i] - B[i];
			if(C[i] < 0) C[i] += NN, C[i + 1]--;
		}
		while(C[C.len - 1] == 0 && C.len > 1) C.len--;
		return C;
	} 
	bool operator < (const Bigint& B)const {//比较绝对值，不算符号 
		if(len != B.len) return len < B.len;
		for(rg int i = len - 1; i >= 0; i--)
			if(A[i] != B[i]) return A[i] < B[i];
		return false;
	}
	Bigint operator - ()const {
		Bigint C(*this);
		C.f *= -1;
		return C;
	}
	Bigint operator + (const Bigint& B)const {
		if(f == B.f) {
			Bigint C = Plus(*this, B);
			C.f *= f;
			return C;
		}
		else {
			if(*this < B) {
				Bigint C = Minus(B, -*this); 
				C.f *= B.f;
				return C;
			}
			else {
				Bigint C = Minus(*this, -B);
				C.f *= f;
				return C; 
			}
		} 
	}
};
Bigint a, b;
int main() {
    //io.RS();
    a.Read(); b.Read();
    (a + b).Write();
    return 0;
}