hdu1002 A + B Problem II
来源:互联网 发布:淘宝上新怎么抢的快 编辑:程序博客网 时间:2024/04/28 11:07
A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 166634 Accepted Submission(s): 31864
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
21 2112233445566778899 998877665544332211
Sample Output
Case 1:1 + 2 = 3Case 2:112233445566778899 + 998877665544332211 = 1111111111111111110
AC代码
#include<iostream>using namespace std;int main(){int t,i,j,k,m,n,x;char str1[1001],str2[1001];int a[1001],b[1001],c[1001]; scanf("%d",&t); k=0;while(t--){ if(k!=0) printf("\n"); k++; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); scanf("%s %s",str1,str2); n=strlen(str1); m=strlen(str2); for(j=0,i=n-1;i>=0;i--,j++) a[j]=str1[i]-'0'; for(j=0,i=m-1;i>=0;i--,j++) b[j]=str2[i]-'0'; if(n>m) x=n; else x=m; for(i=0;i<x;i++) { c[i]+=a[i]+b[i]; if(c[i]>9) { c[i]-=10; c[i+1]+=1; } } printf("Case %d:\n",k);printf("%s + %s = ",str1,str2); if(c[i]!=0) printf("%d",c[i]); for(j=i-1;j>=0;j--) printf("%d",c[j]); printf("\n");}return 0;}
本题为大数A+B,简单题!
谢谢阅读!
- hdu1002 A + B Problem II
- hdu1002 A + B Problem II
- hdu1002 A + B Problem II
- HDU1002 A + B Problem II
- hdu1002 A + B Problem II
- HDU1002--A + B Problem II
- hdu1002 A + B Problem II
- hdu1002 A + B Problem II
- HDU1002 A + B Problem II
- hdu1002 A+B Problem II
- [HDU1002] A + B Problem II
- HDU1002---A + B Problem II
- A + B Problem II---hdu1002
- HDU1002 A + B Problem II
- hdu1002 - A + B Problem II
- HDU1002 A + B Problem II
- HDU1002 A + B Problem II
- hdu1002 A + B Problem II
- C++程序员必看书单
- HTTP 协议详解
- PHP中的ob_start用法详解
- operator new,new operator和placement new的使用
- java中获得汉字首字母
- hdu1002 A + B Problem II
- !!! FAILED BINDER TRANSACTION !!! intent 直接传递数据过大
- Effective C++读书笔记(二)构造、析构、赋值
- JS实现页面跳转的多种方法及区别
- CPCI-S检索(原ISTP)、CPCI-SSH源期刊检索简介
- poj 1330 LCA模版题
- WEB性能测试之重要指标讲解
- Android SQLite3工具常用命令行总结
- 如何写性能测试用例