大数运算

大数运算

struct bign
{
	int d[110];
	int len;
	bign() {
		len = 0;
	}
};

bign change(char str[]) {
	bign a;
	a.len = strlen(str);
	for (int i = 0; i < a.len; i++)
	{
		a.d[i] = str[a.len - i - 1] - '0';
	}
	return a;
}

int jugde(bign a,bign b) {
	if (a.len > b.len) return 1;
	else if (a.len < b.len)return -1;
	else {
		for (int i = a.len-1; i >=0; i++)
		{
			if (a.d[i] > b.d[i])return 1;
			else if (a.d[i] < b.d[i])return -1;
		}
		return 0;
	}
}

bign add(bign a, bign b) {
	bign c;
	int carry = 0;
	for (int i = 0; i < a.len||i<b.len; i++)
	{
		int temp = a.d[i] + b.d[i] + carry;
		c.d[c.len++]=temp%10;
		carry = temp / 10;
	}
	if (carry != 0)c.d[c.len++] = carry;
	return c;
}