A+B Problem II
来源:互联网 发布:安纳金·天行者知乎 编辑:程序博客网 时间:2024/06/06 10:44
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>int shu(char a){ return (a-'0');}int main(){ char a[1000],b[1000]; int num[1001]; int n,i,j=1,al,bl,k,t; scanf("%d",&n); while(n--) { scanf("%s",a); al=strlen(a); scanf("%s",b); bl=strlen(b); k=(al>bl)?al:bl; for(i=0;i<=k;i++) num[i]=0; t=k; for(k;al>0&&bl>0;k--) { num[k]+=shu(a[--al])+shu(b[--bl]); if(num[k]/10) { num[k-1]++; num[k]%=10; } } while(al>0) { num[k--]+=shu(a[--al]); if(num[k+1]/10) { num[k]++; num[k+1]%=10; } } while(bl>0) { num[k--]+=shu(b[--bl]); if(num[k+1]/10) { num[k]++; num[k+1]%=10; } } printf("Case %d:\n",j++); printf("%s + %s = ",a,b); for(i=0;i<=t;i++) { if(i==0&&num[i]==0) i++; printf("%d",num[i]); } printf("\n"); if(n!=0) { printf("\n"); } } return 0;}
0 0
- A + B Problem II
- A + B Problem II
- A + B problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A+B Problem II
- A+B problem II
- A*B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- A + B Problem II
- YAHOO 35条前端优化建议
- POJ-2609-双塔dp
- 像"机器"一样思考
- 导入兼容包
- 向量空间模型(VSM)在文档相似度计算上的简单介绍
- A+B Problem II
- 素数判定(筛选 突破常规)
- webStorm设置颜色和字体大小
- 机器学习并没有那么深奥,它很有趣(2)
- SpringMvc对Servlet原生API的支持
- 矩阵路径最大和
- 汪国新委员参与2016两会文艺组讨论
- Android--权限列表
- 中国日报、大众网等媒体报道 汪国新委员中国式接送有待解决