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

#include <iostream>

using namespace std;

int func1(int n, int m) {
    int i, c;
    for (i = 0; i < m; i++) {
        c = n % 10;
        n /= 10;
    }
    return c;
}

bool func(int n) {
    int i;
    bool f = true;
    for (i = 0; i < 2; i++) {
        if (func1(n, i+1) != func1(n, 5-i))
            f = false;
    }
    return f;
}

int main() {
    int a, b, count = 0;
    cin >> a >> b;
    int i;
    for (i = a; i <= b; i++) {
        if(func(i))
            count++;
    }
    cout << count << endl;
    return 0;
}