nyoj 103A+B Problem II
来源:互联网 发布:美国移交域名管理 编辑:程序博客网 时间:2024/05/16 11:11
A+B Problem II
时间限制:3000 ms | 内存限制:65535 KB
难度:3
描述
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.
A,B must be positive.
输入
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.
输出
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.
样例输入
2
1 2
112233445566778899 998877665544332211
样例输出
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
来源
经典题目
上传者
张云聪
代码:
#include<cstdio>#include<cstring>int main(){int t;scanf("%d",&t);for (int ca=1;ca<=t;ca++){char a[1020],b[1020];int aa[1020]={0},bb[1020]={0};scanf("%s%s",a,b);printf("Case %d:\n%s + %s = ",ca,a,b);int al=strlen(a);int bl=strlen(b);for (int i=0;i<al;i++)aa[i]=a[al-1-i]-'0';for (int i=0;i<bl;i++)bb[i]=b[bl-1-i]-'0';if (al>=bl) for (int ii=0;ii<al;ii++) { aa[ii]+=bb[ii]; if (aa[ii]>9&&ii!=al-1) { aa[ii+1]++; aa[ii]%=10; } } else for (int ii=0;ii<bl;ii++) { bb[ii]+=aa[ii]; if (bb[ii]>9&&ii!=bl-1) { bb[ii+1]++; bb[ii]%=10; } } if (al>=bl) for (int ii=al-1;ii>=0;ii--) printf("%d",aa[ii]); else for (int ii=bl-1;ii>=0;ii--) printf("%d",bb[ii]); printf("\n"); } return 0;}
- nyoj 103 A + B problem II
- nyoj 103-A+B Problem II
- NYOJ 103 A+B Problem II
- nyoj 103 A+B Problem II
- NYOJ 103 A+B Problem II
- NYOJ 103 A+B Problem II
- NYOJ 103 A+B Problem II
- NYOJ 103 A+B Problem II (大数)
- nyoj 103A+B Problem II
- NYOJ 103 A+B Problem II
- NYOJ-103 A+B Problem II
- nyoj-103 A+B Problem II
- NYOJ 103-A+B Problem II
- NYOJ---A+B Problem II
- NYOJ - A+B Problem II
- NYOJ-A+B Problem II
- NYOJ-A*B Problem II
- NYOJ-A+B Problem II
- div 居中
- 文章标题
- Django Start
- LeetCode *** 129. Sum Root to Leaf Numbers
- const、#define、typedef和inline的区别
- nyoj 103A+B Problem II
- Mysql的用户权限管理--查看,授权,回收
- Java学习·抽象类练习
- bzoj 2958: 序列染色 递推
- 3.26 三一 A ZOJ 2110 小狗逃生 BFS 限制时间(步数)
- 如何从键盘输入学生信息,并赋值给数组
- SQL常用语句
- 【matlab】:matlab中strcat函数的妙用
- Missing Number