hdoj1002大数a+b！！！

最新推荐文章于 2018-12-06 09:48:30 发布

liulu1996327

最新推荐文章于 2018-12-06 09:48:30 发布

阅读量296

点赞数

分类专栏：数学问题

本文链接：https://blog.csdn.net/liulu1996327/article/details/44571211

版权

数学问题专栏收录该内容

5 篇文章 0 订阅

订阅专栏

A + B Problem II

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

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()
{ int a[1010],b[1010],c[1010];
int i,j,k,n;
char s1[1010],s2[1010];
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%s%s",s1,s2);
  int l1=strlen(s1);
  int l2=strlen(s2);
  memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
      memset(c,0,sizeof(c));
      for(j=l1-1,k=0;j>=0;j--)
      a[k++]=s1[j]-'0';
      for(j=l2-1,k=0;j>=0;j--)
      b[k++]=s2[j]-'0';
      int max=l2;
      if(l1>l2) max=l1;
      for(j=0;j<max;j++)
      { c[j]+=a[j]+b[j];
      if(c[j]>=10) // 逐位相加大于等于10，实现进位
      { c[j]-=10;
      c[j+1]++;}
  }
  if(c[max])
  max++;
   printf("Case %d:\n",i);
   for(j=0;j<l1;j++)
   printf("%c",s1[j]);
   printf(" + ");
   for(j=0;j<l2;j++)
   printf("%c", s2[j]);
   printf(" = ");
    for(j=max-1;j>=0;j--)
    printf("%d",c[j]);
    printf("\n");
    if(i!=n)
    printf("\n");
}
return 0;
}