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

#include <iostream>
using namespace std;

int main(){
    int a, b;
    cin >> a >> b;

    int r=0;
    for(int i=a;i<=b;i++){
        int s=i%10, t=i/10000 % 10;
        int u=i/10 % 10, v = i/1000%10;
        if(s==t && u == v) r++;
    }

    // int r = (b-a)/100-1;
    
    // if(a%100 <= (a/10000 + a/1000%10*10)){
    //     r++;
    // } 
    // if(b%100 >= (b/10000 + b/1000%10*10)){
    //     r++;
    // }

    cout << r << endl;
}