SRM509 Div2 Easy(250) PalindromizationDiv2
int rev( int x ) { int r = 0; int t = x; for ( int i=1; t>0; i*=10 ) r = r*10 + t%10, t /= 10; return r; } class PalindromizationDiv2{public: int getMinimumCost( int X ) { for ( int i=0; ; i++ ) if ( X+i == rev(X+i) || X-i == rev(X-i) ) return i; }};