杭电 1002 大数相加【关键语句：sum=a[i]-'0'+b[j]-'0'+carry;c[i]='0'+sum%10;//-‘0’字符串转换成数字-‘0’，数字转换成字符串+‘0’】

最新推荐文章于 2024-08-01 13:41:13 发布

Alternative_19

最新推荐文章于 2024-08-01 13:41:13 发布

阅读量2.5k

点赞数

分类专栏： 2016.10 各类error 杭电文章标签： c语言 vc 6 杭电

本文链接：https://blog.csdn.net/alternative_19/article/details/52916467

版权

A + B Problem II

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 324547 Accepted Submission(s): 63050

Problem Description

I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.

Input

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.

Output

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.

Sample Input

  
  
  
   
   
   2
1 2
112233445566778899 998877665544332211

Sample Output

  
  
  
   
   
   Case 1:
1 + 2 = 3

Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110


   
   
   #include<stdio.h>
#include<string.h>
int main()
{
      
    char a[1024],b[1024],c[1024];
    int n,t,l1,l2,l,i,j,carry,sum;
    while(EOF