C语言大数运算（加减乘除）

#define _CRT_SECURE_NO_WARNINGS 1 
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int a[1000], b[1000], c[1000];
//求a,b中最大值
int Max(int a, int b)
{
	if (a > b)
		return a;
	else
		return b;
}
int cmp(int* a, int* b) 
{
	int i, j;
	for (i = 999; a[i] == 0; i--);
	for (j = 999; b[j] == 0; j--);
	if (i < j)                //i指向的a 位数小于b
		return -1;
	else if (i > j)
		return 1;
	else 
	{
		for (; i >= 0; i--)   //对于一个数字，从后往前遍历
		{
			if (a[i] > b[i])  
				return 1;
			else if (a[i] < b[i])
				return -1;
		}
		return 0;
	}
}
//将b拷贝至a，返回此数字的位数
int copy(int* a, int* b) 
{
	int i, j;
	memset(a,0, 4000);
    for (i = 999; b[i] == 0; i--);//b最后一个数的下标为i

	for (j = 0; j <= i; j++)
		a[j] = b[j];
	return i + 1;
}
//加法
void add(char* s1, char* s2) 
{
	memset(a, 0, 4000);
	memset(b, 0, 4000);
	memset(c, 0, 4000);
	printf("%s + %s = ", s1, s2);//123 456 
    int i, t = 0, n1 = strlen(s1), n2 = strlen(s2), n = max(n1, n2);
	for (i = 0; i < n1; i++)
		a[i] = s1[n1 - 1 - i] - '0';//321
	for (i = 0; i < n2; i++)
		b[i] = s2[n2 - 1 - i] - '0';//654 
	for (i = 0; i < n; i++)
	{
		c[i] = (a[i] + b[i] + t) % 10;
		t = (a[i] + b[i] + t) / 10;
	}
    if (t != 0)
		c[n++] = 1;
	for (i = n - 1; i >= 0; i--)
		printf("%d", c[i]);
	printf("\n");
}
//减法
void sub(char* s1, char* s2)
{
	memset(a, 0, 4000);
	memset(b, 0, 4000);
	memset(c, 0, 4000);
	printf("%s - %s = ", s1, s2);
	int i, t = 0, n1 = strlen(s1), n2 = strlen(s2), n = max(n1, n2);
	for (i = 0; i < n1; i++)
		a[i] = s1[n1 - 1 - i] - '0';
	for (i = 0; i < n2; i++)
		b[i] = s2[n2 - 1 - i] - '0';
	char ch = 0;
	int* pa = a;
	int* pb = b;
	int* pt = pa;
	if (n2 > n1)
	{
		ch = '-';
		pa = pb;
		pb = pt;
	}
	else
	{
		int ret = cmp(a, b);
		if (ret == -1)
		{
			ch = '-';
			pa = pb;
			pb = pt;
		}
	}
    for (i = 0; i < n; i++)
	{
		c[i] = pa[i] - pb[i] - t;
		if (c[i] < 0)
		{
			t = 1;
			c[i] += 10;
		}
		else
			t = 0;
	}
	printf("%c", ch);
	for (i = n - 1; i >= 0; i--)
		printf("%d", c[i]);
	printf("\n");
}
//乘法
void mul(char* s1, char* s2)
{
	memset(a, 0, 4000);
	memset(b, 0, 4000);
	memset(c, 0, 4000);
	printf("%s * %s = ", s1, s2);
	int i, j, k=0, tmp = 0, t, n1 = strlen(s1), n2 = strlen(s2);
	for (i = 0; i < n1; i++)
		a[i] = s1[n1 - 1 - i] - '0';
	for (i = 0; i < n2; i++)
		b[i] = s2[n2 - 1 - i] - '0';
	for (i = 0; i < n1; i++)
	{
		for (k = i, j = 0; j < n2; j++)
			c[k++] += a[i] * b[j];
	}
	for (i = 0; i <= k; i++)
	{
		c[i] += tmp;
		t     =  c[i];
		c[i]  =  t % 10;
		tmp   =  t / 10;
	}
	for (i = k; i>=0 && c[i] == 0; i--);
	for (; i >= 0; i--)
		printf("%d", c[i]);
	printf("\n");
}
void dvs(char* s1, char* s2)
{

}
int main()
{
	add("20", "5");
	sub("20", "5");
	mul("20", "5");
	dvs("20", "5");
	return 0;
}