////////////////////////////////////////////////////////////// //****************CHALLENGE: REVERSE INTEGER****************** //****************VERSION 1.0 (with integer)****************** //****************Author: Petros Simidyan********************* ////////////////////////////////////////////////////////////// #include #include using namespace std; inline int digitNumber(int n)//need to solve a problem with disappearing zeros { int count = 0; while (n > 0) { count++; n /= 10; } return count; } inline int reverseInt(int input) { int output = 0; while (input > 0) { output = 10 * output + input % 10; input /= 10; } return output; } int main() { int input, output; cout << "Please give an integer greater than 0!" << endl; cin >> input; if (cin.fail())//checking the input is an integer? cout << "The given input is not an integer!" << endl; else if (input<= 0) cout << "The given integer is less, or equal 0!" << endl; else { output = reverseInt(input); cout << "Here is the inverse of input:" << endl; if (digitNumber(input) != digitNumber(output))//solving problem with zeros cout << setw(digitNumber(input)) << setfill('0') <

REVERSE INTEGER 1.0