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++ (Clang 3.8.0) (judge verdict: Accepted)

#include <iostream>
#include <string>
using namespace std;

int main(void) {
    int A,B;
    cin>>A>>B;
    int cnt = 0;
    for (int i = A; i <= B; i++) {
        if (i % 10 == 0) continue;
        string str = to_string(i);
        string r_str = str;
        reverse(r_str.begin(), r_str.end());
        if (str == r_str) cnt++;
    }
    cout << cnt << endl;
    return 0;
}