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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;

int main(){
  int A,B,a,n,x1,x2,x3,x4;
  int count=0;
  cin>>A>>B;
  n=B-A;
  a=A;
  for(int i=0;i<n;i++){
    x4=a%10;
    a=a/10;
    x3=a%10;
    a=a/100;
    x2=a%10;
    a=a/10;
    x1=a%10;
    if(!(x1-x4||x2-x3)){
      count+=1;
      a=A+1;
    }
  }
  cout<<count<<endl;
}