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 9.2.1) (judge verdict: Accepted)

#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;

int findDigits(int n) {
  int cnt = 0;
  int kaibun[5];
  rep(i, 5) {
    kaibun[i] = n % 10;
    n /= 10;
  }
  if (kaibun[0] == kaibun[4] && kaibun[1] == kaibun[3]) cnt++;

  return cnt;
}

int main() {
  int a, b;
  cin >> a >> b;
  int ans = 0;

  for (int i = a; i <= b; i++) {
    ans += findDigits(i);
  }
  cout << ans << endl;

  return 0;
}