Submit | All submissions | Best solutions | Back to list |
Problem hidden on 2013-11-21 00:36:33 by Mitch Schwartz
NUMREV - Tragedy Of Comedians |
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 number is 1245,it will become
5421 .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.
Your task is to reverse a number.
INPUT
The input consists of T cases (<=10). The first line of the input contains
only positive integer T. Then follow N cases. Each case consists of exactly one line with
one positive integer N(<=1000000000).
OUTPUT
For each case, print exactly one line containing only one integer - the reversed number. Omit any leading zeros in the output.
Sample input:
3
24
4358
305
Sample output:
42
8534
503
Added by: | Aditya Dixit |
Date: | 2013-09-02 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM32-GCC ASM64 MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |