A + B Problem II

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>

int main(int argc, char* argv[])
{
 int n, i;
 scanf("%d", &n);

 char** a = new char* [n];
 char** b = new char* [n];
 char** r = new char* [n];
 
 for (i = 0; i < n; ++i)
 {
  a[i] = new char [1000];
  b[i] = new char [1000];
  r[i] = new char [1000];
  memset(r[i], 0 , sizeof(char)*1000);
 }

 for (i = 0; i < n; ++i)
 {
  scanf("%s", a[i]);
  scanf("%s", b[i]);
 }

 for (i = 0; i < n; ++i)
 {
  printf("Case %d:/n", i+1);
  int aSize = strlen(a[i]);
  int bSize = strlen(b[i]);
  int k = 0, v = 0, u = 0, j;
  while (true)
  {
   if (aSize <= 0 && bSize <= 0)
   { 
    if (u>0)
     r[i][k++] = u+'0';
    break;
   }
   else if (aSize <= 0)
   {
    v = b[i][bSize-1]-'0'+u;
    u = v>9?v/10:0;
    v = v>9?v%10:v;
    r[i][k++] = v+'0';
    --bSize;
   }
   else if (bSize <= 0)
   {
    v = a[i][aSize-1]-'0'+u;
    u = v>9?v/10:0;
    v = v>9?v%10:v;
    r[i][k++] = v+'0';
    --aSize;
   }
   else
   {
    v = a[i][aSize-1]-'0'+b[i][bSize-1]-'0'+u;
    u = v>9?v/10:0;
    v = v>9?v%10:v;
    r[i][k++] = v+'0';
    --aSize;
    --bSize;
   }
  }
  for (j = 0; j < k/2; ++j)
  {
   char tmp = r[i][j];
   r[i][j] = r[i][k-j-1];
   r[i][k-j-1] = tmp;
  }

  if (i == n-1)
   printf("%s + %s = %s/n", a[i], b[i], r[i]);
  else
   printf("%s + %s = %s/n/n", a[i], b[i], r[i]);
 }

 delete [] a;
 delete [] b;
 delete [] r;

 return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值