高精度模板

无符号高精

压8位。

#define rg register
#define il 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>
template<typename T> il T read(T& x)
{
    x = 0; T res = 0, f = 1; char ch = getchar();
    for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
    for(; ch >= '0' && ch <= '9'; ch = getchar()) res = res * 10 + int(ch - '0');
    return x = (res * f);
}
il ll read() {ll x; read(x); return x;}
template<typename T> il void write(T x)
{
    if(x < 0) {putchar('-'); x = -x;}
    if(x >= 10) write(x / 10);
    putchar(x % 10 + '0');
}
template<typename T> il void writeln(const T& x) {write(x), putline;}
template<typename T> il void writesp(const T& x) {write(x), putsp;}
template<typename T> il T Max(const T& x, const T& y) {return y < x ? x : y;}
template<typename T> il T Min(const T& x, const T& y) {return y < x ? y : x;}
template<typename T> il void Swap(T& x, T& y) {T tmp = x; x = y; y = tmp;}
il void FileReset() {freopen("test.in", "r", stdin); freopen("test.out", "w", stdout);}
#include<cstring>
const int LEN = 3100;
const int NN = 100000000, N = 8;
char pool[LEN];
struct Bigint
{
	ll A[LEN / N];
	int len;
	
	Bigint()
	{
		memset(A, 0, sizeof A);
		len = 1;
	}
	Bigint(ll l)
	{
		memset(A, 0, sizeof A);
		len = 0;
		if(l == 0) len = 1;
			else
			while(l)
			{
				A[len++] = l % NN;
				l /= NN;
			} 
	}
	void Read()
	{
		memset(A, 0, sizeof A);
		scanf("%s", pool);
		len = 0;
		for(rg int i = strlen(pool) - 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[k] - '0');
			len++;
		}
	}
	void Write()const
	{
		write(A[len - 1]);
		for(rg int i = len - 2; i >= 0; i--)
		{
			for(rg int j = NN / 10; A[i] < j; j /= 10) putchar('0');
			if(A[i]) write(A[i]);
		}
	}
	ll operator [] (const int& k)const {return A[k];}
	ll& operator [] (const int& k) {return A[k];}
	Bigint operator + (const Bigint& B)const//高+高 
	{
		Bigint C;
		C.len = Max(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;
	}
	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& B)const //高减高 
	{
		if(*this < B) {putchar('-'); return B - *this;}
		Bigint C;
		C.len = 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;
		
	}
	Bigint operator * (const Bigint& B)const//高乘高 
	{
		Bigint C;
		C.len = len + B.len - 1;
		for(rg int i = 0; i < len; i++)
			for(rg int j = 0; j < B.len; j++)
				C[i + j] += A[i] * B[j];
		for(rg int i = 0; i < C.len; 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;
	}
	Bigint operator * (const int& B)const//高乘低 
	{
		Bigint C;
		C.len = len;
		for(rg int i = 0; i < len; i++)
		{
			C[i] += A[i] * B;
			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;
	} 
};
int main()
{
	return 0;
}

有符号高精

嗯
会高精的人可以看看这题
我的题解
这里面有正负的高精
woc这题不是人做的