POJ 1504:Adding Reversed Numbers
来源:互联网 发布:淘宝卖手机壳怎么买 编辑:程序博客网 时间:2024/05/20 10:55
Adding Reversed Numbers
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16738 Accepted: 9134
Description
The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure some tragedies into comedies. Obviously, this work is very hard because the basic sense of the play must be kept intact, although all the things change to their opposites. For example the numbers: if any number appears in the tragedy, it must be converted to its reversed form before being accepted into the comedy play.
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).
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
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
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
Sample Output
3419981
Source
Central Europe 1998
你 离 开 了 , 我 的 世 界 里 只 剩 下 雨 。 。 。
#include <iostream>#include <stdio.h>#include <string>using namespace std;int main(){ int ncases,len1,len2,num1,num2,num,y=0,temp,i; string str1,str2; cin>>ncases; while(ncases--) { getchar(); cin>>str1>>str2; y = 0; num1 = 0; num2 = 0; len1 = str1.size(); len2 = str2.size(); for(i=len1-1; i>=0; i--) { num1 *= 10; num1 += str1[i]-'0'; } for(i=len2-1; i>=0; i--) { num2 *= 10; num2 += str2[i]-'0'; } num = num1 + num2; while(num!=0) { temp = num%10; if(temp != 0)y = 1; if(y)cout<<temp; num /= 10; } cout<<endl; } return 0;}
1 0
- poj 1504 Adding Reversed Numbers
- poj 1504 Adding Reversed Numbers
- POJ 1504 adding reversed numbers
- POJ 1504 Adding Reversed Numbers
- POJ 1504 Adding Reversed Numbers
- POJ 1504 Adding Reversed Numbers
- POJ 1504:Adding Reversed Numbers
- poj 1504 Adding Reversed Numbers【反转数字】
- POJ 1504 Adding Reversed Numbers(水~)
- 1504 Adding Reversed Numbers
- pku 1504 Adding Reversed Numbers
- PKU 1504 Adding Reversed Numbers
- POJ 1504 Adding Reversed Numbers…
- Poj 1504 Adding Reversed Numbers(用字符串反转数字)
- poj 1504 Adding Reversed Numbers(简单字符串的处理)
- POJ-1504 Adding Reversed Numbers-逆序数相加
- POJ 1504 Adding Reversed Numbers 已被翻译
- POJ 1504 Adding Reversed Numbers(字符串巧解)
- linux 信号 信号的递送
- 最长递增子序列(dp)
- 设计模式六大原则(1):单一职责原则
- 4-5-创建索引表-串-第4章-《数据结构》课本源码-严蔚敏吴伟民版
- ubuntu将home目录迁移到独立分区
- POJ 1504:Adding Reversed Numbers
- 设计模式六大原则(2):里氏替换原则
- Web项目中的“后台服务”——ajax
- [新手入门]关于数据结构C语言中链表结构的理解
- hdu 2139 Calculate the formula
- 【诠释版】12 steps to Navier-Stokes —— Introduction and Step 1【待修改】
- 网络编程_概念_网络_端口_URL_TCP_UDPJAVA184
- 设计模式六大原则(3):依赖倒置原则
- Android Training学习笔记——App Bar