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>
using namespace std;

int main() {
    int A, B;
    cin >> A >> B;
    int n = 0;
    for(int i = A; i <= B; i++){
        int x4, x3, x1, x0;
        int i0 = i;
        x0 = i0 % 10;
        i0 /= 10;
        x1 = i0 % 10;
        i0 /= 100;
        x3 = i0 % 10;
        i0 /= 10;
        x4 = i0 % 10;
        if(x0 == x4 && x1 == x3){
            n++;
        }
    }
    cout << n << endl;
}