Problem:
Score : 200 points

Problem Statement

Find the number of palindromic numbers among the integers between A and B (inclusive).
Here, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.

Constraints

10000 \leq A \leq B \leq 99999

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the number of palindromic numbers among the integers between A and B (inclusive).

Sample Input 1

11009 11332

Sample Output 1

4

There are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.

Sample Input 2

31415 92653

Sample Output 2

612

Solution in C++ (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int A, B;
  cin >> A >> B;
  
  double a=A,b=B;
  
  int flag=0;
  
  while(a<b){
    if( int(a/10000) == int(a)%10 && int(a/1000)%10 == int(a/10)%10 ){
      flag=1;
      break;
    }
    a++;
  }
  
  while(a<b){
    if( int(b/10000) == int(b)%10 && int(b/1000)%10 == int(b/10)%10 ){
      flag=1;
      break;
    }
    b--;
  }
  
  int ans=0;
  if( (a-b+flag)!=0 ){
    ans=ceil( (b-a)/100 );
    if( int(a-b)%100==0 ){
      ans=int(1+(a-b)/100);          
    }
  }

  cout<< ans <<endl;
  
}