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, a1, a2, b1, b2, c;
  cin >> a >> b;
  a1 = a/10000;
  a2 = a/1000-10*a1;
  b1 = b/10000;
  b2 = b/1000-10*b1;
  if (a%1000 > a%1000-a%100+a1+10*a2) c+=1;
  if (b%1000 < b%1000-b%100+b1+10*b2) c+=1;
  cout << b/100-a/100-c+1 << endl;
}