Adding Reversed Numbers
来源:互联网 发布:网络监控集中管理软件 编辑:程序博客网 时间:2024/04/28 03:54
Reversed number is a number written in arabic numerals but the order of digits is reversed. The first digit becomes last and vice versa. For example, if the main hero had 1245 strawberries in the tragedy, he has 5421 of them now. Note that all the leading zeros are omitted. That means if the number ends with a zero, the zero is lost by reversing (e.g. 1200 gives 21). Also note that the reversed number never has any trailing zeros.
ACM needs to calculate with reversed numbers. Your task is to add two reversed numbers and output their reversed sum. Of course, the result is not unique because any particular number is a reversed form of several numbers (e.g. 21 could be 12, 120 or 1200 before reversing). Thus we must assume that no zeros were lost by reversing (e.g. assume that the original number was 12).
Input Specification
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line with two positive integers separated by space. These are the reversed numbers you are to add.
Output Specification
For each case, print exactly one line containing only one integer - the reversed sum of two reversed numbers. Omit any leading zeros in the output.
Sample Input
324 14358 754305 794
Output for the Sample Input
3419981
#include<iostream>#include<string>using namespace std;int main(){ int T; //indicates the number of test cin>>T; for(int i=0;i<T;++i) { string strL,strS; //分别代表长字符串和短字符串 char carry='0'; //carry代表近位 cin>>strL>>strS; if(strL.size()<strS.size())//swap the two string //交换 { string tempstr=strS; strS=strL; strL=tempstr; } for(int i=0;i<strS.size();++i) //按位进行加法运算 { int temp=int(strL[i]+strS[i]+carry-144); strL[i]=char(temp%10+48); carry=char(temp/10+48); } if(carry!='0') //处理最后一位进位 { if(strL.size()==strS.size())strL.push_back(carry); else { for(int i=strS.size();i<strL.size();++i) { int temp=int(strL[i]+carry-96); strL[i]=char(temp%10+48); carry=char(temp/10+48); } if(carry!='0')strL.push_back(carry); } } for(int i=strL.find_first_not_of('0');i<strL.size();++i) //从第一个不为0的字符开始输出 cout<<strL[i]; cout<<endl; } //system("pause"); return 0;}
- 1504 Adding Reversed Numbers
- poj1504 Adding Reversed Numbers
- Adding Reversed Numbers
- Adding Reversed Numbers
- Adding Reversed Numbers
- B - Adding Reversed Numbers
- Adding Reversed Numbers
- B - Adding Reversed Numbers
- 2210. Adding Reversed Numbers
- zoj_2001 Adding Reversed Numbers
- Adding Reversed Numbers(0058)
- 【POJ1504】:Adding Reversed Numbers
- zoj2001 Adding Reversed Numbers
- poj1504 Adding Reversed Numbers
- pku 1504 Adding Reversed Numbers
- PKU 1504 Adding Reversed Numbers
- ZOJ2001 POJ1504 Adding Reversed Numbers
- poj 1504 Adding Reversed Numbers
- Surprising Strings
- ubuntu获取root用户权限
- Platform SDK 字符串处理 API
- eclipse的js插件安装
- Ubuntu下彻底卸载apache2
- Adding Reversed Numbers
- binary search
- Android Studio开发初级教程
- 字典树
- C程序设计语言--全局/局部变量、头文件、堆栈空间、静态变量
- CODE 60: Set Matrix Zeroes
- 并查集两种优化方法(按秩合并,压缩存储)
- 最新阿里巴巴2014校招研发笔试题目回忆
- 一致性哈希算法