hdu1002 高精度之A+B

题目来源:hdoj1002

A + B Problem II

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


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
 

Author
Ignatius.L
 

Recommend
We have carefully selected several similar problems for you:   1008  1089  1093  1092  1009

解析:裸地高精度加法,具体算法请自行百度。 
 
代码:
#include<cstdio>
#include<cstring>
#define maxn 1000
using namespace std;

char a[maxn+100],b[maxn+100];
int c[maxn+10];

void redirect()
{
  freopen("1.in","r",stdin);
  freopen("1.out","w",stdout);
}

void work()
{
  int i,j,k=0,last=0,len1=strlen(a)-1,len2=strlen(b)-1;
  while(len1>=0 && len2>=0)
    {
      c[++k]=a[len1]-'0'+b[len2]-'0'+last;
      last=c[k]/10,c[k]%=10;
      len1--,len2--;
	}
	
  while(len1>=0)
    {
      c[++k]=a[len1]-'0'+last;
      last=c[k]/10,c[k]%=10;
      len1--;
    }	
    
  while(len2>=0)
    {
      c[++k]=b[len2]-'0'+last;
      last=c[k]/10,c[k]%=10;
      len2--;
    }
    
  while(k>0)printf("%d",c[k]),k--;	  
  printf("\n");
}

int main()
{
  redirect();
  int t,i,j,k;
  scanf("%d\n",&t);
  for(i=1;i<=t;i++)
    {
      scanf("%s%s\n",a,b);
      printf("Case %d:\n%s + %s = ",i,a,b);
      work();
      if(i<t)printf("\n");
    }

  return 0;
}


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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值