HDU 1002 ????
来源:互联网 发布:sql笔试题及答案 编辑:程序博客网 时间:2024/06/04 03:59
HDU 1002 大数相加,题目的链接如下:
http://acm.hdu.edu.cn/showproblem.php?pid=1002
A + B Problem II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 315379 Accepted Submission(s): 61186
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
2
1 2
112233445566778899 998877665544332211
Sample Output
Case 1:
1 + 2 = 3
Case 2:
112233445566778899 + 998877665544332211 = 1111111111111111110
#include <iostream>#include <cstring>#include <string>using namespace std ;/*int OJ(int m,int n){ int r; r=m%n; while(r!=0){ m=n; n=r; r=m%n; } return n;}*/string add(string a, string b){ if(a == "0" && b=="0") return "0"; if(a=="0") return b; if(b=="0") return a; string max , min; max = a , min = b ; if(a.length() < b.length()){ max = b ; min = a ; } int c = max.length()-1, d = min.length()-1; for(int i=d ; i>=0 ; i--){ max[c--] += min[i] - '0'; } for(int i=max.length()-1 ; i>0 ; i--){ if(max[i] > '9'){ max[i] -= 10 ; max[i-1]++; } } if(max[0] > '9') { max[0] -= 10; max = '1' + max ; } return max ;}string str1 , str2 , str3 ;using namespace std ;int main(){ int n , t = 1; cin >> n ; for(int i=0 ; i<n ; i++) { cin >> str1 >> str2 ; cout << "Case " << t << ":" << endl ; str3 = add(str1, str2); cout << str1 << " + " << str2 << " = " << str3 << endl; if(t<n) cout << endl ; t++; } return 0 ;}
- HDU 1002
- hdu 1002
- HDU-1002
- hdu 1002
- HDU 1002
- HDU 1002
- hdu 1002
- hdu 1002
- hdu 1002
- hdu 1002
- HDU 1002
- hdu 1002
- hdu 1002
- hdu 1002
- HDU 1002
- HDU 1002
- hdu 1002
- hdu 1002
- 搜索引擎检索的一点经验
- Java 注解的作用与使用
- 安装数据库提示无法解析机器名处理
- Js中的prototype
- php上传文件那些事
- HDU 1002 ????
- Android Fragment应用实战
- POJ 1182 食物链 *
- 使用IntelliJ IDEA开发SpringMVC网站(二)框架配置
- 蛇形填数
- hdu5750Dertouzos
- java基础之访问修饰符
- EasyUI_Datagrid编辑-键盘上下键选择行(一)
- 寻找最小的k个数