＆lt; Sicily＆gt; 1000. number reversal

The original question is as follows

1000. Number reversal Time Limit: 1sec Memory Limit:256MB

Description

Given an integer , Please reverse the number in each digit to get a new number . New numbers should also satisfy the common form of integers , That is, unless the given original number is zero , Otherwise, the highest digit of the new number after inversion should not be zero （ See example 2）.

Input

Input common 1 That's ok , An integer N. -1,000,000,000 ≤ N≤ 1,000,000,000.

Output

The output, 1 That's ok , An integer , Represents the new number after inversion .

Sample Input

 Examples 1：
123
 Examples 2：
-380

Copy

Sample Output

 Examples 1：
321
 Examples 2：
-83

Copy

Ideas

In fact, it is to keep putting the low numbers on the high ones , You can continuously withdraw the balance 、 ride 10、 except 10 To complete .

Code

#include <iostream>

using namespace std;

int main(){
	int input;
	cin >> input;
	int output = 0;
	int r = input % 10;
	while (input != 0){
		r = input % 10;
		input = input / 10;
		output = output * 10 + r;
	}
	cout << output;
} 

Copy