转载请注明出处:http://blog.csdn.net/u012860063?viewmode=contents
一:加法
1、普通两个大数相加
代码如下:
#include <cstdio>
#include <cmath>
#include <cstring>
void fan(char s[])
{
char t;
int i,j;
for(i = 0,j = strlen(s)-1; i <= j; i++,j--)
{
t=s[i];
s[i]=s[j];
s[j]=t;
}
}
int main()
{
int p = 0, g = 0,h = 1;
int k, l;
char x[100010], y[100010], z[100010];
while(scanf("%s%s",x,y)!=EOF)
{
p = 0;
fan(x);
fan(y);
k = strlen(x);
l = strlen(y);
int i;
for(i = 0; i < k || i < l; i++)
{
if(i < k && i < l )
z[i] = x[i]+y[i]+ p-'0';
else if(i < k && i >= l)
z[i] = x[i]+p;
else if(i >= k && i < l)
z[i] = y[i]+p;
if(z[i] > '9')
{
z[i]-=10;
p = 1;
}
else
p = 0;
}
if(p)
z[i++] = '1';
z[i] = '\0';
fan(x);
fan(y);
fan(z);
printf("%s + %s = %s\n",x,y,z);
}
return 0;
}
2、多个大数相加://poj 1503
#include <cstdio>
#include <cstring>
const int MAXN = 117;
int main()
{
char s[MAXN];
int sum[MAXN] = {0};
int i, j;
while(gets(s))
{
int len = strlen(s);
if(s[0] == '0' && len == 1)
break;
for(i = 110, j = len-1; j >= 0; i--, j--)
{
sum[i] += s[j]-'0';
}
}
for(i = 110; i > 0; i--)
{
sum[i-1] += sum[i] / 10;
sum[i] %= 10;
}
for(i = 0; sum[i] == 0 && i < 111; i++)
{
if(i == 111)//意味着全为零
{
printf("0\n");
}
}
for( ; i < 111; i++)
{
printf("%d",sum[i]);
}
printf("\n");
return 0;
}
二:大数乘法
1、普通模拟乘法(char )
代码如下://POJ 2389