# A + B Problem II

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

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>
void main()
{
int n,i,j,c[1002],d[1002],e[1002],l1,l2,l,x;
char a[1002],b[1002];
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<1002;j++)
{
a[j]='0';
b[j]='0';
c[j]=0;
d[j]=0;
e[j]=0;
}
scanf("%s %s",a,b);
l1=strlen(a);
l2=strlen(b);
l=l1>l2 ? l1:l2;
x=0;
for(j=l1-1;j>=0;j--)
{
c[j]+=a[x++]-'0';
}
x=0;
for(j=l2-1;j>=0;j--)
{
d[j]+=b[x++]-'0';
}
for(j=0;j<l;j++)
{
e[j]=c[j]+d[j];
}
for(j=0;j<l;j++)
{
if(e[j]>9)
{
e[j]-=10;
e[j+1]++;
}
}
if(e[l]!=0)
l++;
printf("Case %d:\n",i+1);
printf("%s + %s = ",a,b);
for(j=l-1;j>=0;j--)
printf("%d",e[j]);
if(i!=n-1)
printf("\n\n");
else
printf("\n");
}
}```

0 条评论

• ### HDU 1075 字典树 字符串匹配

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/204800 K (Java...

• ### Angularjs和jQuery的ajax的请求区别

Angularjs和jQuery的ajax的请求是不同的。在jquery中，官方文档解释contentType默认是application/x-www-fo...

• ### HDU 1027 组合数学

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Ot...

• ### 【SAP FICO系列】SAP ABAP的替代和校验

I. Creating, activating and transporting validations and substitutions 1. Whic...

• ### PAT (Advanced Level) Practice 1039 Course List for Student (25分)

Zhejiang University has 40000 students and provides 2500 courses. Now given the ...

• ### IBM刀片服务器管理模块恢复出厂默认值实战

Resetting the management module back to factory defaults

• ### 可压缩的Euler和Navier-Stokes方程的全离散显式局部熵稳定格式（CS NA）

近年来，为了保证常微分方程解的一个全局泛函的保存，人们发展了各种逐次近似法。我们推广了这种方法来保证有限多凸函数(熵)的局部熵不等式，并将其应用于可压缩Eule...

• ### 【Codeforces 738C】Road to Cinema

http://codeforces.com/contest/738/problem/C

• ### 通过关注最成功的伙伴来阻止叛逃者的入侵（CS.GT）

根据空间公共物品博弈的标准协议，合作者不仅投入到自己的博弈中，也投入到相邻伙伴组织的博弈中。在这项研究中，我们放松了这个假设，让合作者决定更喜欢哪个相邻的组，而...