ZOJ 2001 Adding Reversed Numbers
来源:互联网 发布:完结小说 排行榜 知乎 编辑:程序博客网 时间:2024/04/28 03:45
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).
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
3
24 1
4358 754
305 794
Sample Output
34
1998
1
int reserve(int n)
{
int r=0;
while(n)
{
r=r*10+n%10;
n=n/10;
}
return r;
}
int main()
{
int N;
scanf("%d",&N);
while(N--)
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",reserve(reserve(a)+reserve(b)));
}
return 0;
}
- zoj 2001 Adding Reversed Numbers
- ZOJ 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- ZOJ 2001 Adding Reversed Numbers
- ZOJ 2001 Adding Reversed Numbers
- Adding Reversed Numbers(zoj 2001)
- ZOJ 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers
- ZOJ Problem Set - 2001 Adding Reversed Numbers
- ZOJ Problem Set - 2001 Adding Reversed Numbers
- zoj 2001.Adding Reversed Numbers
- zoj 2001 Adding Reversed Numbers(大水水一个~)
- 大数问题 ZOJ Problem Set - 2001 Adding Reversed Numbers
- 1504 Adding Reversed Numbers
- poj1504 Adding Reversed Numbers
- Adding Reversed Numbers
- Adding Reversed Numbers
- Weblogic的Transaction Timeout风波
- Pentaho 之Schame workbench入门实例
- android Gravity 类解析
- about python
- C# 中关闭当前线程的四种方式
- ZOJ 2001 Adding Reversed Numbers
- 跟我一起写 Makefile(九) .
- [转载]error LNK2001: unresolved external symbol __DllMainCRTStartup@12错误
- 路上看水
- Synchronized 关键字的理解
- 设计模式C++实现(14)——职责链模式
- 多线程和异步
- office2010安装出错 提示“error 1406”的图文解决步骤
- 总是弹出拨号连接