NYOJ-A+B Problem II
来源:互联网 发布:联通网络被禁止了 编辑:程序博客网 时间:2024/04/29 19:08
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.
- 样例输入
21 2112233445566778899 998877665544332211
- 样例输出
Case 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110
代码:
#include<stdio.h>#include<string.h>char a[1010],b[1010];int s1[1010],s2[1010];int sum[1010];int main(){int T,k=0,i,j,d,c;scanf("%d",&T);while(T--){memset(s1,0,sizeof(s1));memset(s2,0,sizeof(s2));memset(sum,0,sizeof(sum));k++;scanf("%s %s",a,b);int len1,len2;len1=strlen(a);len2=strlen(b);for(i=len1-1,j=0;i>=0;--i,++j)s1[j]=a[i]-'0';for(i=len2-1,j=0;i>=0;--i,++j)s2[j]=b[i]-'0';c=0;for(i=0;i<len1||i<len2;++i){d=s1[i]+s2[i]+c;sum[i]=d%10;c=d/10;}printf("Case %d:\n",k);printf("%s + %s = ",a,b);if(c)sum[i++]=c;for(;i>0;--i)if(sum[i])break;for(;i>=0;--i)printf("%d",sum[i]);printf("\n");}return 0;}
0 0
- 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
- NYOJ-623:A*B Problem II
- NYOJ-A*B Problem II-623
- nyoj 103 A + B problem II
- nyoj 103-A+B Problem II
- NYOJ 103 A+B Problem II
- NYOJ 623 A*B Problem II
- nyoj-623-A*B Problem II
- nyoj 103 A+B Problem II
- NYOJ 103 A+B Problem II
- NYOJ 623 A*B Problem II
- NYOJ 103 A+B Problem II
- NYOJ 623 A*B Problem II
- nyoj 623 A*B Problem II
- 报复老公出轨 我和别的男人开房
- android:Message处理机制
- 嵌入式启动之二:资源宽裕型嵌入式系统
- 字符串的截取,判断字符串是否相等和字符串是否为空的方法总结Java,Android
- java synchronized
- NYOJ-A+B Problem II
- 如何创建与调用动态链接库
- QT的"cannot find -lqtmaind"解决解决办法
- Android消息处理
- HDU 1862 EXCEL排序【sort排序】
- javascript取反再取反的作用
- VOIP 架构和技术(VOIP Architecture and Technologies)
- android:自动横竖屏切换在各种需求下的处理
- (七)scheduler 定时器