杭电1753--大明A+B

Problem Description
话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字叫“大明”。
这时他已经不是那个只会做100以内加法的那个“小明”了,现在他甚至会任意长度的正小数的加法。

现在,给你两个正的小数A和B,你的任务是代表大明计算出A+B的值。
 

Input
本题目包含多组测试数据,请处理到文件结束。
每一组测试数据在一行里面包含两个长度不大于400的正小数A和B。
 

Output
请在一行里面输出输出A+B的值,请输出最简形式。详细要求请见Sample Output。
 

Sample Input
1.1 2.9 1.1111111111 2.3444323343 1 1.1
 

Sample Output
4 3.4555434454 2.1
# include<stdio.h>
# include<string.h>
int main()
{
               int a[410],b[410],c[410],d[410],flag2;
               int i,j,k,len1,len2;
               char s1[410],s2[410];
               while(scanf("%s%s",s1,s2)!=EOF)
               {
                               memset(a,0,sizeof(a));
                               memset(b,0,sizeof(b));
                               memset(c,0,sizeof(c));
                               memset(d,0,sizeof(d));
                               len1=strlen(s1);
                               flag2=1;
                               for(i=0;s1[i];i++)//判断是否有小数点(1)
                                              if(s1[i]=='.')
                                                             break;
                               k=0;
                               for(j=i-1;j>=0;j--) //存整数部分(2)
                                              a[k++]=s1[j]-'0';
                               k=0;                    //存小数部分,并把个位作为吧b[0](3)
                               b[k++]=0;
                               if(i<len1-1)
                                              for(j=i+1;s1[j];j++)
                                                             b[k++]=s1[j]-'0';
                               len2=strlen(s2);
                               for(i=0;s2[i];i++)//操作同(1)
                                              if(s2[i]=='.')
                                                             break;
                               k=0;
                               for(j=i-1;j>=0;j--)  //操作同(2)
                                              c[k++]=s2[j]-'0';
                               k=0;          
                               d[k++]=0;   //操作同(3)
                               if(i<len2-1)
                                              for(j=i+1;s2[j];j++)
                                                             d[k++]=s2[j]-'0';
                               for(i=0;i<410;i++)//整数部分相加,存a中
                               {
                                              a[i]+=c[i];
                                              if(a[i]>=10)
                                              {
                                                             a[i+1]++;
                                                             a[i]-=10;
                                              }
                               }
                               for(i=409;i>=1;i--)//小数部分相加,存b中
                               {
                                              b[i]+=d[i];
                                              if(b[i]>=10)
                                              {
                                                             b[i-1]++;
                                                             b[i]-=10;
                                              }
                               }
                               a[0]+=b[0];
                               
                               for(i=0;i<410;i++)
                                              if(a[i]>=10)
                                              {
                                                             a[i+1]++;
                                                             a[i]-=10;
                                              }
                               
                               i=409;
                               while(a[i]==0&&i>=0)
                                              i--;
                               //printf("%d",a[i--]);
                               while(i>=0)
                               {
                                              printf("%d",a[i]);
                                              i--;
                               }
                               i=409;
                               while(b[i]==0&&i>=1)
                                              i--;
                               if(i==0)//判断小数部分是否全为0
                                              flag2=0;
                               if(flag2==0)   //如果是,不输出
                                              printf("\n");
                               else if(flag2==1)  //否则输出小数部分
                               {
                                              printf(".");
                                              for(j=1;j<=i;j++)
                                                             printf("%d",b[j]);
                                              printf("\n");
                               }
               }
               return 0;
} 

 其中增加部分为高人指点,此题方才AC,谨在此表示感谢!!!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值