第一次写博客,菜鸟记录记录自己的学习过程
原理比较简单,利用数组存储大数,按逆序进行对应位置的相加,并逐个处理进位。
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
char a[1001], b[1001];
int a1[1001], b1[1001], sum[1001];
int n, t1, t2, t;
int num=0;
scanf("%d", &n);
getchar();
while (n--)
{
num++;
int j;
scanf("%s",&a);
scanf("%s",&b);
t1 = strlen(a);
t2 = strlen(b);
memset(a1, 0, sizeof(a1));
memset(b1, 0, sizeof(b1));
memset(sum, 0, sizeof(sum));
for (int i = t1 - 1, j = 0; i >= 0; i--, j++)
a1[j] = a[i]-'0';
for (int i = t2 - 1, j = 0; i >= 0; i--, j++)
b1[j] = b[i]-'0';
t = max(t1, t2);
for (int i = 0; i < t; i++)
sum[i] = a1[i] + b1[i];
for (int i = 0; i < t; i++)
{
if (sum[i] > 9)
{
sum[i + 1]+= sum[i] / 10;
sum[i] = sum[i] % 10;
}
}
cout << "Case " << num << ":" << endl;
for (int i = t1 - 1; i >= 0; i--)
printf("%d", a1[i]);
printf(" + ");
for (int i = t2 - 1; i >= 0; i--)
printf("%d",b1[i]);
printf(" = ");
if (sum[t] != 0)
for (int i = t; i >= 0; i--)
printf("%d", sum[i]);
else for (int i = t - 1; i >= 0; i--)
printf("%d", sum[i]);
if (n)
printf("\n\n");
else printf("\n");
}
return 0;
}
这题比较磨人的就是输出格式,PE了好多次~~,我写的较繁琐