1001
来源:互联网 发布:有黄播的直播软件 编辑:程序博客网 时间:2024/04/26 06:40
Problem Description
I have a very simple problem for you. Given two integers A and B, your jobis to calculate the Sum of A + B.
Input
The first line of the input contains an integer T(1<=T<=20) whichmeans the number of test cases. Then T lines follow, each line consists of twopositive integers, A and B. Notice that the integers are very large, that meansyou should not process them by using 32-bit integer. You may assume the lengthof 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 isthe an equation "A + B = Sum", Sum means the result of A + B. Notethere are some spaces int the equation. Output a blank line between two testcases.
Sample Input
2
1 2
112233445566778899998877665544332211
Sample Output
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 +998877665544332211 = 1111111111111111110
#include<iostream>
using namespace std;
#include<string>
int strlen(string str)
{
int a=0;
while(str[a++]);
return a-2;
}
int main()
{
intn,m,a,s1,s2,x,y;
char str[10];
stringstr1,str2,str3;
cin>>n;
gets(str);
for(a=1;a<=n;a++)
{
cin>>str1>>str2;
m=0;
str3="";
x=strlen(str1);y=strlen(str2);
while(x>=0||y>=0)
{
s1=0;
if(x>=0) s1+=str1[x]-48;
if(y>=0) s1+=str2[y]-48;
str3+=(s1+m)%10+48;
m=(s1+m)/10;
x--;y--;
}
if(m>0)str3+=m+48;
s2=strlen(str3);
cout<<"Case "<<a<<":"<<endl;
cout<<str1<<" + "<<str2<<" =";
while(s2>=0) cout<<str3[s2--];
cout<<endl;
if(a!=n)cout<<endl;
}
return 0;
}
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- 1001
- sql server 修改系统密码后不能启动的解决办法
- JAVA并发编程学习笔记之Unsafe类
- 深入理解hadoop(一)----Common的实现----Configuration
- Android API之android.widget.Filterable
- 使用HtmlParser 解析链接节点
- 1001
- 安装Sql2005出错 1935 0x800700200
- Android自动化测试用例规范
- android library projects cannot be launched
- JAVA并发编程学习笔记之ReentrantLock
- UIWebView 自定义网页中的alert和confirm提示框风格
- 使用apktool反编译apk文件的资源信息
- 第1章 C语言概述
- Floyd算法