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: Accepted)

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

int main(){
  int A,B;
  cin >> A >> B;
  int number;
  for(int i = A;i<=B;i++){
    int a,b,c,d,e;
    a = i/10000;
    b = (i-(i/10000*10000))/1000;
    c = (i-(i/1000*1000))/100;
    d = (i-(i/100*100))/10;
    e = i-(i/10*10);
    if(a == e && b == d){
      number++;
    }
  }
  cout << number << endl;
}