report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
  • Problem
  • Submit
  • Results
Reverse - FlandreOJ: Flandre Online Judge

Reverse

Time limit: 1000 ms
Memory limit: 256 MB
Given two integers $a$ and $b$, find their sum and print the reversed version of this sum. Ensure that the reversed sum does not have a digit '0' at the beginning. ### Input - A single line containing two integers $a$ and $b$. ### Output - Print an integer representing the reversed sum of $a$ and $b$, with no '0' at the beginning. ### Constraints - $1 \le a,b \le 10^9$. ### Example Input: ``` 1000 230 ``` Output: ``` 321 ```
Loop
Loop
Even numbers
Factorial
Star Triangle
Folding paper
Fraction
Divisors
Complex Exponentiation
Prime number
Digit Sum
Fibonacci
Read number till eternity
Extremal
Reverse
Mushroom exchanging
Trailing zeros
Decimal to binary
Binary to decimal
Division
Solution
Topic
Basic
Rating 800
Solution (0) Solution