问题描述: 将形如1234567890123456789不能储存在long变量中的数称为超长整数或大整数。现讨论大整数的加减乘除运算。
思想方法: 用数组存储超长整数,且为处理的简单起见约定每个元素存放相同位的数字。如:每个元素存放4位。
1、加法运算
void add(int *a, int *b, int *c)
{
int i;
for(i = N - 1; i >= 0; i--) //模拟竖式加法,同位相加再加进位
{
c[i] = a[i] + b[i] + carry;//carry是进位
carry=c[i]/10000;
c[i]=c[i]%10000;
}
}
2、减法运算
void sub(int *a, int *b, int *c)
{
int i;
for(i =N- 1; i >= 0; i--) //模拟竖式减法,同位相减再减借位
{
c[i] = a[i] - b[i] - borrow;//borrow是借位
if(c[i] >= 0)
borrow = 0;
else // 有借位时
{
c[i] = c[i] + 10000;
borrow = 1;
}
}
}
3、乘法运算
3.1 大整数与整数
void mul(int *a, int b, int *c)
{ // b 为乘数
int i, tmp;
carry = 0;//carry为进位
for(i =N- 1; i >=0; i--)//模拟竖式乘法
{
tmp = a[i] * b + carry;
c[i] = tmp % 10000;
carry = tmp / 10000;
}
}
3.2 大整数与大整数
void mul2(int *a, int *b, int *c)
{ long tmp = 0;
int carry, idc;
for (int i=N-1; i>=0; i--) {c[i] = 0;}//初始化数组,清零,N是数组的长度
for (int i=N-1;i>=N/2;i--)
{
carry = 0; idc=i;
for (int j=N-1;j>=N/2;j--)
{
tmp=b[i]*a[j]+carry+c[idc];
c[idc]=tmp%K;
carry=tmp/K;
idc--;
}
c[idc]+=carry;
}
}
3、除法运算
void div(int *a, int b, int *c)
{
int i, tmp;
for(i =0; i <N; i++)
{
tmp = a[i] + remain* 10000;
c[i] = tmp / b;
remain =tmp % b;
}
}
void div2(int *a, int b, int *c)
{
int i, tmp, remain = 0;
for(i = 0; i < N; i++)
{
tmp = a[i] + remain;
c[i] = tmp / b;
remain = (tmp % b) * 10000;
}
}
下附程序的完整代码:
#include <stdio.h>
const int N=4; //数组的长度
//加法
static int carry=0;
void add(int *a, int *b, int *c)
{int i;
for(i = N - 1; i >= 0; i--)
{c[i] = a[i] + b[i] + carry;
carry=c[i]/10000;
c[i]=c[i]%10000;
}
}
//减法
int borrow=0;
void sub(int *a, int *b, int *c)
{
int i;
for(i =N- 1; i >= 0; i--)
{
c[i] = a[i] - b[i] - borrow;
if(c[i] >= 0)
borrow = 0;
else // 借位
{
c[i] = c[i] + 10000;
borrow = 1;
}
}
}
//乘法(大整数与整数)
void mul(int *a, int b, int *c)
{ // b 为乘数
int i, tmp;
carry = 0;
for(i =N- 1; i >=0; i--)
{
tmp = a[i] * b + carry;
c[i] = tmp % 10000;
carry = tmp / 10000;
}
}
//乘法2(大整数与大整数)
void mul2(int *a, int *b, int *c)
{ long tmp = 0;
int carry, idc;
int K = 10000;
for (int i=N-1; i>=0; i--) {c[i] = 0;}
for (int i=N-1;i>=N/2;i--)
{
carry = 0; idc=i;
for (int j=N-1;j>=N/2;j--)
{
tmp=b[i]*a[j]+carry+c[idc];
c[idc]=tmp%K;
carry=tmp/K;
idc--;
}
c[idc]+=carry;
}
}
//除法
int remain=0;
void div(int *a, int b, int *c)
{
int i, tmp;
for(i =0; i <N; i++)
{
tmp = a[i] + remain* 10000;
c[i] = tmp / b;
remain =tmp % b;
}
}
//除法2
void div2(int *a, int b, int *c)
{
int i, tmp, remain = 0;
for(i = 0; i < N; i++)
{
tmp = a[i] + remain;
c[i] = tmp / b;
remain = (tmp % b) * 10000;
}
}
void print(int *c,int k)
{int i;
for (i=0;i<k;i++)
printf("%04d",c[i]);
printf("\n");
}
void print2(int *c,int k)
{
for(int i=0;i<k;i++)
printf("%4d",c[i]);
printf("\n");
}
int main(){
int i,d=11,a[N]={1112,3111,1111,1111},b[N]={6711,1111,9111,1111},c[N];
for (i=0;i<N;i++)
{c[i]=0;}
//1112,3111,1111,1111+6711,1111,9111,1111=7823,4223,0222,2222
add(a,b,c);
if (carry==1)//如果最高位有进位
printf("%d",carry);
print(c,N);
//1112,3111,1111,1111-6711,1111,9111,1111=-5598,8000,8000,0000
sub(a,b,c);
if (borrow==0) //如果最高位有借位
print(c,N);
else
{
borrow=0;
sub(b,a,c);
printf("-");
print(c,N);
}
//1112,3111,1111,1111*11=1,2235,4222,2222,2221
for (i=0;i<N;i++)
{ c[i]=0;}
mul(a,d,c);
if (carry!=0) printf("%d",carry);
print(c,N);
//
mul2(a,b,c);
print2(c,N);
//1112,3111,1111,1111÷11 = 101,1191,9191,9191
for (i=0;i<N;i++)
{c[i]=0;}
div(a,d,c);
print(c,N);
// 1112,3111,1111,1111÷11 = 101,1191,9191,9191
for (i=0;i<N;i++)
{c[i]=0;}
div2(a,d,c);
print2(c,N);
return 0;
}