王道机试4.9：高精度整数

代码实现：

#include<stdio.h>
#include<string.h>
struct bigInteger
{
	int digit[1000];
	int size;
	void init(){
		for (int i = 0; i < 1000; i++)
		{
			digit[0] = 0;
		}
		size = 0;
	}
	void set(char str[]){
		init();
		int L = strlen(str);
		for (int i = L-1,j=0,t=0,c=1; i >= 0; i--)
		{
			t += (str[i] - '0')*c;
			j++;
			c *= 10;
			if (j==4||i==0)
			{
				digit[size++] = t;
				j = 0;
				t = 0;
				c = 1;
			}
		}
	}
	void output(){
		for (int  i = size-1; i >= 0; i--)
		{
			if (i!=size-1)
			{
				printf("%04d", digit[i]);
			}
			else
			{
				printf("%d", digit[i]);
			}
		}
		printf("\n");
	}
	bigInteger operator + (const bigInteger &A)const{
		bigInteger ret;
		ret.init();
		int carry = 0;
		for (int i = 0; i < A.size||i<size; i++){
			int tmp = A.digit[i] + digit[i] + carry;
			carry = tmp / 10000;
			tmp %= 10000;
			ret.digit[ret.size++] = tmp;
		}
		if (carry!=0)
		{
			ret.digit[ret.size++] = carry;
		}
		return ret;
	}
}a,b,c;
char str1[1002], str2[1002];
int main(){
	while (scanf("%s%s",str1,str2)!=EOF)
	{
		a.set(str1);
		b.set(str2);
		c = a + b;
		c.output();
	}
	return 0;
}

N的阶乘：

#include<stdio.h>
#include<string.h>
struct bigInteger
{
	int digit[1000];
	int size;
	void init(){
		for (int i = 0; i < 1000; i++)
		{
			digit[i] = 0;
		}
		size = 0;
	}
	void set(int x){
		init();
		do
		{
			digit[size++] = x % 10000;
			x /= 10000;
		} while (x!=0);
	}
	void output(){
		for (int i = size-1; i >= 0; i--)
		{
			if (i!=size-1)
			{
				printf("%04d", digit[i]);
			}
			else
			{
				printf("%d", digit[i]);
			}
		}
		printf("\n");
	}
	bigInteger operator *(int x) const{
		bigInteger ret;
		ret.init();
		int carry = 0;
		for (int i = 0; i < size; i++)
		{
			int tmp = x*digit[i] + carry;
			carry = tmp / 10000;
			tmp %= 10000;
			ret.digit[ret.size++] = tmp;
		}
		if (carry != 0)
		{
			ret.digit[ret.size++] = carry;
		}
		return ret;
	}
}a;
int main(){
	int n;
	while (scanf("%d",&n)!=EOF)
	{
		a.init();
		a.set(1);
		for (int i = 1; i <= n; i++)
		{
			a = a*i;
		}
		a.output();
	}
	return 0;
}

代码实现：

#include<stdio.h>
#include<string.h>
#define maxDigits 100
struct bigInteger
{
	int digit[maxDigits];
	int size;
	void init(){
		for (int i = 0; i < maxDigits; i++){
			digit[i] = 0;
		}
		size = 0;
	}
	void set(int x){
		init();
		do
		{
			digit[size++] = x % 10000;
			x /= 10000;
		} while (x!=0);
	}
	void output(){
		for (int i = size-1; i >= 0; i--)
		{
			if (i!=size-1)
			{
				printf("%04d", digit[i]);
			}
			else
			{
				printf("%d", digit[i]);
			}
		}
		printf("\n");
	}
	bigInteger operator *(int x) const{
		bigInteger ret;
		ret.init();
		int carry = 0;
		for (int i = 0; i < size; i++)
		{
			int tmp = x*digit[i] + carry;
			carry = tmp / 10000;
			tmp %= 10000;
			ret.digit[ret.size++] = tmp;
		}
		if (carry != 0)
		{
			ret.digit[ret.size++] = carry;
		}
		return ret;
	}
	bigInteger operator + (const bigInteger &A)const{
		bigInteger ret;
		ret.init();
		int carry = 0;
		for (int i = 0; i < A.size||i<size; i++){
			int tmp = A.digit[i] + digit[i] + carry;
			carry = tmp / 10000;
			tmp %= 10000;
			ret.digit[ret.size++] = tmp;
		}
		if (carry!=0)
		{
			ret.digit[ret.size++] = carry;
		}
		return ret;
	}
	bigInteger operator /(int x) const{
		bigInteger ret;
		ret.init();
		int remainder = 0;
		for (int i =size - 1; i >= 0; i--)
		{
			int t = (remainder * 10000 + digit[i]) / x;
			int r = (remainder * 10000 + digit[i]) % x;
			ret.digit[i] = t;
			remainder = r;
		}
		ret.size = 0;
		for (int i = 0; i < maxDigits; i++)
		{
			if (digit[i]!=0)
			{
				ret.size = i;
			}
		}
		ret.size++;
		return ret;
	}

	int operator %(int x)const{
		int remainder = 0;
		for (int i = size-1; i >= 0; i--)
		{
			int t = (remainder * 10000 + digit[i]) / x;
			int r = (remainder * 10000 + digit[i]) % x;
			remainder = r;
		}
		return remainder;
	}
}a,b,c;
char str[10000];
char ans[10000];
int main(){
	int n, m;
	while (scanf("%d%d",&m,&n)!=EOF)
	{
		scanf("%s", str);
		int L = strlen(str);
		a.set(0);
		b.set(1);
		for (int i = L - 1; i >= 0; i--)
		{
			int t;
			if (str[i]>='0'&&str[i]<='9')
			{
				t = str[i] - '0';
			}
			else
			{
				t = str[i] - 'A' + 10;
			}
			a = a + b*t;
			b = b*m;
		}
		int size = 0;
		do
		{
			int t = a%n;
			if (t>=10)
			{
				ans[size++] = t - 10 + 'a';
			}
			else
			{
				ans[size++] = t + '0';
			}
			a = a / n;
		} while (a.digit[0]!=0||a.size!=1);
		for (int i = size-1; i >= 0; i--)
		{
			printf("%c", ans[i]);
		}
		printf("\n"); 
	}
	return 0;
}