hdu1002 A + B Problem II

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

llnou

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

阅读量288

点赞数

分类专栏：大数 A+B

本文链接：https://blog.csdn.net/llnou/article/details/38303961

版权

A+B 同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

大数

1 篇文章 0 订阅

订阅专栏

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];
  char s1[1010],s2[1010];
  int n,m=1;
  scanf("%d",&n);
  getchar();
  while(n--)
  {
      int i,j,l=0;
      scanf("%s",s1);        //读入字符串s1,s1.
      scanf("%s",s2);
      printf("Case %d:\n",m++);  //先输出格式，注意空格
      printf("%s + %s = ",s1,s2);
      memset(a,0,sizeof(a));
      memset(b,0,sizeof(b));
      for(j=0,i=strlen(s1)-1;i>=0;i--)
      a[j++]=s1[i]-'0';  //把字符串变成数组，倒序赋值给数组
      for(j=0,i=strlen(s2)-1;i>=0;i--)
      b[j++]=s2[i]-'0';
      for(i=0;i<1000;i++)
      {
      a[i]+=b[i];
      if(a[i]>9)
      a[i]-=10,a[i+1]+=1;  //各位相加，进位
      }
      for(i=1000;i>=0;i--)
      if(a[i]!=0)         //从不为0的那位开始倒序输出 
      {l=i;break;}
      for(i=l;i>=0;i--)  //输出
      printf("%d",a[i]);
      if(n)
     printf("\n\n");  
     else printf("\n");
    }
 return 0; 
}
  
  
  
  
   
   //第二次写又有新发现
  
  
  
  
   
   #include<stdio.h>
#include<string.h>
#define N 1000
char s1[N+10],s2[N+10];
int a[N+10],b[N+10];
int main()
{
 int t,i,j,l=1,m;
 scanf("%d",&t);
 getchar();
 while(t--)
 {
   
   
   //gets(s1);    //不能用gets，因为gets函数以回车键为结束标志，而两数据间是空格，不能正确读入数据
  
  
  
  
   
     //gets(s2);
    scanf("%s",s1);
    scanf("%s",s2);
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    for(i=0,j=strlen(s1)-1;j>=0;j--)
    a[i++]=s1[j]-'0';
    for(i=0,j=strlen(s2)-1;j>=0;j--)
    b[i++]=s2[j]-'0';
    for(i=0;i<1000;i++)
    {
      a[i]+=b[i];
      if(a[i]>9)
      a[i]-=10,a[i+1]+=1;
    }
  
  
  
  
   
       printf("Case %d:\n",l++);
  
  
  
  
   
       printf("%s + %s = ",s1,s2);
    for(i=1000;i>=0;i--)
    if(a[i]!=0)
    {m=i;break;}
    for(i=m;i>=0;i--)
    printf("%d",a[i]);
    printf("\n");
    if(t)
    printf("\n"); 
   
    //处理空格
 }
 return 0;
}