杭电ACM-A + B Problem II

</pre>Problem Description<p></p><p><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Times New Roman'; font-size:14px">I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.</span></strong></span></p><p><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Times New Roman'; font-size:14px"></span></strong></span></p><p><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong>Input</strong></span></span></strong></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><strong>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.</strong></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong>Output</strong></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Times New Roman'; font-size:14px">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.</span></strong></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Times New Roman'; font-size:14px"></span></strong></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong>Sample Input</strong></span></span></strong></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">2</span></strong></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">1 2</span></strong></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">112233445566778899 998877665544332211</span></strong></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"></span></strong></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong>Sample Output</strong></span></span></strong></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">Case 1:</span></strong></span></span></span></span></span></span></p><p><span style="font-family: 'Courier New', Courier, monospace; font-size: 14px; white-space: pre-wrap; font-weight: bold;">1 + 2 = 3</span></p><p><span style="font-family: 'Times New Roman'; font-size: 14px;"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"></span></strong></span></span></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">Case 2:</span></strong></span></span></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">112233445566778899 + 998877665544332211 = 1111111111111111110</span></strong></span></span></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"></span></strong></span></span></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap">上代码：</span></strong></span></span></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"></span></strong></span></span></span></span></span></span></p><p><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Times New Roman'; font-size:14px"><span style="font-family:Arial; font-size:18px; font-weight:bold"><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"><span style="font-family:Arial; font-size:18px"><strong><span style="font-family:'Courier New',Courier,monospace; font-size:14px; white-space:pre-wrap"></span></strong></span></span></span></span></span></span></p><pre name="code" class="cpp">#include <stdio.h>
#include <string.h>

char * result(char *a,char *b)
{
	int len=0,i,k=0,j=0,temp=0;
	char c='0';
	char s[1001];
	char * str=new char[1001];
	int lena=strlen(a);
	int lenb=strlen(b);
	//将输入的数据化为逆序；
	for(i=0,j=lena-1;i<lena/2;i++,j--)
	{
		c=a[i];
		a[i]=a[j];
		a[j]=c;
	}
	a[lena]='\0';
	for(i=0,j=lenb-1;i<lenb/2;i++,j--)
	{
		c=b[i];
		b[i]=b[j];
		b[j]=c;
	}
	b[lenb]='\0';
	//已输入数据的大长度设为len，小长度补充0到len；
	if(lena>lenb)
	{
		len=lena;
		for(i=lenb;i<len;i++)
			b[i]='0';
		b[i]='\0';
	}
	else 
	{
		len=lenb;
		for(i=lena;i<len;i++)
			a[i]='0';
		b[i]='\0';
	}
	//加法运算；
	for(i=0;i<len;i++)
	{
		k=(a[i]-'0')+(b[i]-'0')+temp;
		s[i]=k%10+'0';
		temp=k/10;
	}
	//进位判断；
	if(temp>0)
	{
		s[i]=temp+'0';
		len=len+1;
	}
	s[len]='\0';
	//将结果再转换成逆序；
	for(i=0,j=len-1;i<len;i++,j--)
		*(str+i)=s[j];
	*(str+len)='\0';
	return str;
}

int main()
{
	char a[1001],b[1001];
	char * c;
	int n=0,i=0;
	scanf("%d",&n);
	while(i<n)
	{
		scanf("%s%s",a,b);
		i++;
		printf("Case %d:\n",i);
		printf("%s + %s = ",a,b);
        c=result(a,b);
		printf("%s\n",c);
		if(i!=n)
			printf("\n");
	}
	return 0;

}