hdu 1002 A+B Problem

最新推荐文章于 2020-08-17 22:11:42 发布

旋影

最新推荐文章于 2020-08-17 22:11:42 发布

阅读量401

点赞数

分类专栏：大数

本文链接：https://blog.csdn.net/u010101875/article/details/9977685

版权

大数专栏收录该内容

3 篇文章 0 订阅

订阅专栏

A + B Problem II

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

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>
#define max 1010
int main()
{
 int t,i,j,k,l,len1,len2;
 int ans1[max],ans2[max];
 char str1[max],str2[max];
 scanf("%d",&t);
 for(l=1;l<=t;l++)
 {
  memset(ans1,0,sizeof(ans1));
     memset(ans2,0,sizeof(ans2));
  scanf("%s%s",str1,str2);
  len1=strlen(str1);
  k=0;
  for(i=len1-1;i>=0;i--)
   ans1[k++]=str1[i]-'0';
  len2=strlen(str2);
  k=0;
  for(j=len2-1;j>=0;j--)
   ans2[k++]=str2[j]-'0';
  for(i=0;i<max;i++)
  {
   ans1[i]+=ans2[i];
   if(ans1[i]>=10)
   {
    ans1[i]-=10;
    ans1[i+1]++;
   }
  }
  for(i=max-1;ans1[i]==0 && i>=0;i--) ;
  if(i>=0)
  {
   printf("Case %d:\n%s + %s = ",l,str1,str2);
   for(;i>=0;i--)   
    printf("%d",ans1[i]);
  }
  else
   printf("Case %d:\n%s + %s = 0\n",l,str1,str2);
  printf("\n");
  if(l!=t)
   printf("\n");
 }
 return 0;
}