hdu A+B
来源:互联网 发布:台湾留学生在大陆知乎 编辑:程序博客网 时间:2024/06/01 07:37
A+B
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
21 2112233445566778899 998877665544332211
Sample Output
Case 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110
#include<stdio.h>#include<string.h>char a[1005],b[1005];int c[1005];int main(){ int t,m=1; scanf("%d",&t); while(m<=t) { memset(c,0,sizeof(c)); scanf(" %s %s",a,b); int i,j,k,la,lb,cnt; la=strlen(a); lb=strlen(b); cnt=la>lb?la:lb; la-=1; lb-=1; for(i=0; la>=0; i++,la--)//反转大数 { c[i]+=a[la]-'0'; } for(i=0; lb>=0; i++,lb--)//反转并求和 { c[i]+=b[lb]-'0'; if(c[i]>=10)//处理进位 { c[i]-=10; c[i+1]+=1; } } while(c[i]) { if(c[i]>=10)//处理进位 { c[i]-=10; c[i+1]+=1; } i++; } for(j=cnt; j>=0; j--)//去除前面多余的0 if(c[j]!=0) break; printf("Case %d:\n",m++); printf("%s + %s = ",a,b); if(j!=-1)//注意答案可能为0 { for(i=j; i>=0; i--) printf("%d",c[i]); } else printf("0"); if((m-1)==t) printf("\n"); else printf("\n\n"); } return 0;}
1 0
- HDU 2033 A+B
- HDU 2034 A-B
- hdu 1412 {A} + {B}
- HDU 1096 A+B
- HDU A^B
- HDU 1412 {A}+{B}
- hdu 1228A+B
- HDU 1412 ( {A} + {B} )
- HDU 1228 ( A + B )
- hdu 1288 A + B
- hdu 1228 A + B
- HDU 1229 A + B
- HDU 1412 {A}+{B}
- hdu A/B
- hdu A/B
- hdu 1228 A + B
- HDU 1228 A+B
- hdu A + B problem
- 在MyEclipse上安装windowBuilder插件
- NS-3中的OnOffApplicaion作为协议仿真的CBR源
- ns3-3
- 正则表达式
- ns3-4
- hdu A+B
- BZOJ1633: [Usaco2007 Feb]The Cow Lexicon 牛的词典 DP
- 计数排序—《算法导论》学习笔记之五
- ns3-5
- NYoj 024素数距离问题
- ns3-6
- NYoj 169 素数
- ns3-7
- 1124