HDU——A + B Problem II

HDU   1002

A + B Problem II

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

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
  
  

用C++编程语言会出现超时错误

代码如下：

#include<stdio.h>
#include<string.h>
int main()
{
	char a[1000],b[1000],ans[1003];
	int len1,len2;
	int i,p=0;
	int t,kk=0;
	scanf("%d",&t);
	while(t){
		scanf("%s%s",&a,&b);
		printf("Case %d:\n%s + %s = ",++kk,a,b);
		memset(ans,0,sizeof(ans));
		len1=strlen(a)-1;
		len2=strlen(b)-1;
		for(i=0;len1>=0 || len2>=0;i++,len1--,len2--){
			if(len1>=0 && len2>=0){
				ans[i]=a[len1]+b[len2]-'0'+p;
			}
			if(len1>=0 && len2<0){
				ans[i]=a[len1]+p;
			}
			if(len1<0 && len2>=0){
				ans[i]=b[len2]+p;
			}
			p=0;
			if(ans[i]>'9'){
				ans[i]-=10;
				p=1;
			}
		}
		while(i--){
			printf("%c",ans[i]);
		}	
		if(t!=1)  printf("\n\n");
		else		printf("\n");
		t--;
	}
	return 0;
}

HDU   1002

A + B Problem II

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

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
   
   

用C++编程语言会出现超时错误

代码如下：

#include<stdio.h>
#include<string.h>
int main()
{
	char a[1000],b[1000],ans[1003];
	int len1,len2;
	int i,p=0;
	int t,kk=0;
	scanf("%d",&t);
	while(t){
		scanf("%s%s",&a,&b);
		printf("Case %d:\n%s + %s = ",++kk,a,b);
		memset(ans,0,sizeof(ans));
		len1=strlen(a)-1;
		len2=strlen(b)-1;
		for(i=0;len1>=0 || len2>=0;i++,len1--,len2--){
			if(len1>=0 && len2>=0){
				ans[i]=a[len1]+b[len2]-'0'+p;
			}
			if(len1>=0 && len2<0){
				ans[i]=a[len1]+p;
			}
			if(len1<0 && len2>=0){
				ans[i]=b[len2]+p;
			}
			p=0;
			if(ans[i]>'9'){
				ans[i]-=10;
				p=1;
			}
		}
		while(i--){
			printf("%c",ans[i]);
		}	
		if(t!=1)  printf("\n\n");
		else		printf("\n");
		t--;
	}
	return 0;
}