高精度模板

自己一点一点敲出来的，累！！

#include<cstdio>
#include<cstring>
#include<algorithm>
#define REP(i, a, b) for(int i = (a); i < (b); i++)
#define _for(i, a, b) for(int i = (a); i <= (b); i++)
using namespace std;

const int MAXN = 112;
const int base = 10000; //压4位效率高且省空间 
struct node
{
	int len, s[505]; //s的范围开太大空间会炸，时间也会多 
	node() { len = 0; memset(s, 0, sizeof(s)); } //如果要表示0就直接 node ans就好了 
};                                                   //len = 0时表示值为0

//比较大小
bool judge(node a, node b) //这种写法很简略 
{
    if(a.len != b.len) return a.len > b.len;
    for(int i = a.len; i >= 1; i--)
        if(a.s[i] != b.s[i]) return a.s[i] > b.s[i];
    return true;
}

//高精度加法 
node operator + (const node& a, const node& b) 
{                                              
	node c;
	int& len = c.len = max(a.len, b.len);
	
	_for(i, 1, len)
	{
		c.s[i] += a.s[i] + b.s[i]; //这里一定是+=，不是= 
		c.s[i+1] += c.s[i] / base;
		c.s[i] %= base;
	} 
	
	if(c.s[len+1]) len++;
	return c;
}

//高精度减法 
node operator - (bignum a, const bignum& b)
{
    for(int i = a.len; i >= 1; i--)
    {
        a.s[i] -= b.s[i];
        if(a.s[i] < 0) a.s[i+1]--, a.s[i] += base;
    }
    while(!a.s[a.len] && a.len > 0) a.len--;
    return a;
}

//高精度*高精度 
node operator * (const node& a, const node& b)
{
	node c;
	int& len = c.len = b.len + a.len - 1;
	
	_for(i, 1, a.len)
		_for(j, 1, b.len)
		{
			c.s[i+j-1] += a.s[i] * b.s[j];
			c.s[i+j] += c.s[i+j-1] / base;
			c.s[i+j-1] %= base;
		}
	
	if(c.s[len+1]) len++;
	return c;
}

//低精度*高精度 
node operator * (const int& a, const node& b) //系统会根据数据类型来判断是低精度乘高精度还是高精度乘高精度 
{
	node c;
	int& len = c.len = b.len;
	
	_for(i, 1, b.len)
	{
		c.s[i] += b.s[i] * a;
		c.s[i+1] += c.s[i] / base;
		c.s[i] %= base;
	}
	
	while(c.s[len+1] > 0) 
	{
		c.len++;
		c.s[len+1] += c.s[len] / base;
		c.s[len] %= base;
	}
	
	return c;
}

//读入
char str[10000 + 5];
void read(node& a) 
{
    scanf("%s", str);
    reverse(str, str + strlen(str)); //先翻转再说 
    int& len = a.len = 0;
    for(int i = 0, w; i < strlen(str); i++, w *= 10)
    {
        if(i % 4 == 0) len++, w = 1;
        a.s[len] += w * (str[i] - '0');
    }
}

//输出
void print(bignum a)
{
    printf("%d", a.s[a.len]);
    for(int i = a.len - 1; i >= 1; i--)
        printf("%04d", a.s[i]);
    puts("");
}

 

洛谷 P1080 国王游戏

#include<bits/stdc++.h>
#define REP(i, a, b) for(int i = (a); i < (b); i++)
#define _for(i, a, b) for(int i = (a); i <= (b); i++)
using namespace std;

const int MAXN = 1e4 + 10;
struct node
{
	int l, r;
}a[MAXN];

bool cmp(node x, node y)
{
	return x.r * x.l < y.r * y.l;
}

struct bignum
{
	int s[MAXN], len;
	bignum() { memset(s, 0, sizeof(s)); len = 0; } //初始化 
};

bignum ma(bignum a, bignum b)
{
	if(a.len > b.len) return a;
	if(a.len < b.len) return b;
	for(int i = a.len; i >= 1; i--)
	{
		if(a.s[i] > b.s[i]) return a;
		if(a.s[i] < b.s[i]) return b;
	}
	return a;
}

bignum operator * (bignum a, int b) //注意这个先乘再进位再位数。不要从0开始弄位数，因为可能中间有0 
{
	int& len = a.len;
	_for(i, 1, len) a.s[i] *= b;
	_for(i, 1, len) a.s[i+1] += a.s[i] / 10, a.s[i] %= 10;  
	while(a.s[len+1])
	{
		len++; //先加再处理进位 
		a.s[len+1] += a.s[len] / 10;
		a.s[len] %= 10;
	}
	return a;
}

bignum operator / (bignum a, int b) //这种重载运算符的写法非常的爽。同时复习高精度除以低精度，其实不难，自己写个竖式模拟一下就好了 
{
	int yu = 0;
	bignum res; res.len = a.len;
	for(int i = a.len; i >= 1; i--)
	{
		int t = yu * 10 + a.s[i]; //把握好余数 
		res.s[i] = t / b;
		yu = t % b;
	}
	while(!res.s[res.len] && res.len > 0) res.len--;
	return res;
}

bignum init(int x) //int初始化成bignum 
{
	bignum res;
	int& len = res.len; //&主要是偷懒，不用写那么长 
	while(x)
	{
		len++;
		res.s[len] = x % 10;
		x /= 10;
	}
	return res;
}

void print(bignum x) //输出 
{
	for(int i = x.len; i >= 1; i--) printf("%d", x.s[i]);
}

int main()
{	
    int n, x, y;
	scanf("%d%d%d", &n, &x, &y);
	
	REP(i, 0, n) scanf("%d%d", &a[i].l, &a[i].r);
	sort(a, a + n, cmp);
	
	bignum ans = init(0), sum = init(x);
	REP(i, 0, n)
	{
		ans = ma(ans, sum / a[i].r);
		sum = sum * a[i].l;
	}
	print(ans);
	
	return 0;
}

模板的应用