80 大整数相加
作者: xxx时间限制: 1S章节: 字符串
问题描述 :
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
输入说明 :
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consists of two positive integers, A and B. Notice that the integers are very large, that means you should not process them by using 32-bit integer. You may assume the length of each integer will not exceed 1000.
输出说明 :
For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line is the an equation “A + B = Sum”, Sum means the result of A + B. Note there are some spaces int the equation. Output a blank line between two test cases.
输入范例 :
2
1 2
112233445566778899 998877665544332211
输出范例 :
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
解决思路:
1.两个数从个位开始相加 进位就到高位
2.注意格式输出 数组空间可以开大点(防止越界)
#include <stdio.h>
#include <string.h>
int main(){
int T;
scanf("%d", &T);
int j,k;
for (j = 1; j <= T; j++){
char number1[1000];
char number2[1000];
int sum[1000] = {0};//置0
//memset(sum, 0, sizeof(int));//int 类型怎么置0
scanf("%s%s", number1, number2);
int len1 = strlen(number1);
int len2 = strlen(number2);
int i;
for (i = 0; i < len1 || i < len2; i++){
if (i < len1)
sum[i] += number1[len1 - i - 1] - '0';//字符转换为数字
if (i < len2)
sum[i] += number2[len2 - i - 1] - '0';
if (sum[i] >= 10)
{
sum[i + 1] = sum[i] / 10;
sum[i] = sum[i] % 10;
}
}
printf("Case %d:\n", j);//格式输出
for (k = 0; k<len1; k++)
printf("%c", number1[k]);
printf(" ");
printf("+");
printf(" ");
for (k = 0; k<len2; k++)
printf("%c", number2[k]);
printf(" ");
printf("=");
printf(" ");
if (len1 < len2)//判断谁最长
len1 = len2;
if (sum[i]>0)
printf("%d", sum[i]);//最高位产生进位
for (i = len1 - 1; i >= 0; i--)
printf("%d", sum[i]);
printf("\n\n");
}
return 0;
}
小结:
1.字符串处理大数加运算
2.字符转换为数字(不要犯错误)